NEWS
author wenzelm
Tue Apr 17 15:34:58 2018 +0200 (14 months ago)
changeset 67993 271e2d84e7a3
parent 67928 7f5b1b6f7f40
child 67999 1b05f74f2e5f
permissions -rw-r--r--
NEWS;
     1 Isabelle NEWS -- history of user-relevant changes
     2 =================================================
     3 
     4 (Note: Isabelle/jEdit shows a tree-view of the NEWS file in Sidekick.)
     5 
     6 
     7 New in this Isabelle version
     8 ----------------------------
     9 
    10 *** General ***
    11 
    12 * Marginal comments need to be written exclusively in the new-style form
    13 "\<comment> \<open>text\<close>", old ASCII variants like "-- {* ... *}" are no longer
    14 supported. INCOMPATIBILITY, use the command-line tool "isabelle
    15 update_comments" to update existing theory files.
    16 
    17 * Old-style inner comments (* ... *) within the term language are legacy
    18 and will be discontinued soon: use formal comments "\<comment> \<open>...\<close>" or "\<^cancel>\<open>...\<close>"
    19 instead.
    20 
    21 * The "op <infix-op>" syntax for infix operators has been replaced by
    22 "(<infix-op>)". If <infix-op> begins or ends with a "*", there needs to
    23 be a space between the "*" and the corresponding parenthesis.
    24 INCOMPATIBILITY.
    25 There is an Isabelle tool "update_op" that converts theory and ML files
    26 to the new syntax. Because it is based on regular expression matching,
    27 the result may need a bit of manual postprocessing. Invoking "isabelle
    28 update_op" converts all files in the current directory (recursively).
    29 In case you want to exclude conversion of ML files (because the tool
    30 frequently also converts ML's "op" syntax), use option "-m".
    31 
    32 * The old 'def' command has been discontinued (legacy since
    33 Isbelle2016-1). INCOMPATIBILITY, use 'define' instead -- usually with
    34 object-logic equality or equivalence.
    35 
    36 * Session-qualified theory names are mandatory: it is no longer possible
    37 to refer to unqualified theories from the parent session.
    38 INCOMPATIBILITY for old developments that have not been updated to
    39 Isabelle2017 yet (using the "isabelle imports" tool).
    40 
    41 * Theory header 'abbrevs' specifications need to be separated by 'and'.
    42 INCOMPATIBILITY.
    43 
    44 * Only the most fundamental theory names are global, usually the entry
    45 points to major logic sessions: Pure, Main, Complex_Main, HOLCF, IFOL,
    46 FOL, ZF, ZFC etc. INCOMPATIBILITY, need to use qualified names for
    47 formerly global "HOL-Probability.Probability" and "HOL-SPARK.SPARK".
    48 
    49 * Command 'external_file' declares the formal dependency on the given
    50 file name, such that the Isabelle build process knows about it, but
    51 without specific Prover IDE management.
    52 
    53 * Session ROOT entries no longer allow specification of 'files'. Rare
    54 INCOMPATIBILITY, use command 'external_file' within a proper theory
    55 context.
    56 
    57 * Session root directories may be specified multiple times: each
    58 accessible ROOT file is processed only once. This facilitates
    59 specification of $ISABELLE_HOME_USER/ROOTS or command-line options like
    60 -d or -D for "isabelle build" and "isabelle jedit". Example:
    61 
    62   isabelle build -D '~~/src/ZF'
    63 
    64 * The command 'display_drafts' has been discontinued. INCOMPATIBILITY,
    65 use action "isabelle.draft" (or "print") in Isabelle/jEdit instead.
    66 
    67 * Isabelle symbol "\<hyphen>" is rendered as explicit Unicode hyphen U+2010, to
    68 avoid unclear meaning of the old "soft hyphen" U+00AD. Rare
    69 INCOMPATIBILITY, e.g. copy-paste of historic Isabelle HTML output.
    70 
    71 
    72 *** Isabelle/jEdit Prover IDE ***
    73 
    74 * System options "spell_checker_include" and "spell_checker_exclude"
    75 supersede former "spell_checker_elements" to determine regions of text
    76 that are subject to spell-checking. Minor INCOMPATIBILITY.
    77 
    78 * PIDE markup for session ROOT files: allows to complete session names,
    79 follow links to theories and document files etc.
    80 
    81 * Completion supports theory header imports, using theory base name.
    82 E.g. "Prob" may be completed to "HOL-Probability.Probability".
    83 
    84 * The command-line tool "isabelle jedit" provides more flexible options
    85 for session selection:
    86   - options -P opens the parent session image of -l
    87   - options -A and -B modify the meaning of -l to produce a base
    88     image on the spot, based on the specified ancestor (or parent)
    89   - option -F focuses on the specified logic session
    90   - option -R has changed: it only opens the session ROOT entry
    91   - option -S sets up the development environment to edit the
    92     specified session: it abbreviates -B -F -R -l
    93 
    94   Examples:
    95     isabelle jedit -d '$AFP' -S Formal_SSA -A HOL
    96     isabelle jedit -d '$AFP' -S Formal_SSA -A HOL-Analysis
    97 
    98 * Named control symbols (without special Unicode rendering) are shown as
    99 bold-italic keyword. This is particularly useful for the short form of
   100 antiquotations with control symbol: \<^name>\<open>argument\<close>. The action
   101 "isabelle.antiquoted_cartouche" turns an antiquotation with 0 or 1
   102 arguments into this format.
   103 
   104 * Completion provides templates for named symbols with arguments,
   105 e.g. "\<comment> \<open>ARGUMENT\<close>" or "\<^emph>\<open>ARGUMENT\<close>".
   106 
   107 * Bibtex database files (.bib) are semantically checked.
   108 
   109 * Action "isabelle.preview" is able to present more file formats,
   110 notably bibtex database files and ML files.
   111 
   112 * Action "isabelle.draft" is similar to "isabelle.preview", but shows a
   113 plain-text document draft.
   114 
   115 * When loading text files, the Isabelle symbols encoding UTF-8-Isabelle
   116 is only used if there is no conflict with existing Unicode sequences in
   117 the file. Otherwise, the fallback encoding is plain UTF-8 and Isabelle
   118 symbols remain in literal \<symbol> form. This avoids accidental loss of
   119 Unicode content when saving the file.
   120 
   121 * Update to jedit-5.5.0, the latest release.
   122 
   123 
   124 *** Isabelle/VSCode Prover IDE ***
   125 
   126 * HTML preview of theories and other file-formats similar to
   127 Isabelle/jEdit.
   128 
   129 
   130 *** Document preparation ***
   131 
   132 * Formal comments work uniformly in outer syntax, inner syntax (term
   133 language), Isabelle/ML and some other embedded languages of Isabelle.
   134 See also "Document comments" in the isar-ref manual. The following forms
   135 are supported:
   136 
   137   - marginal text comment: \<comment> \<open>\<dots>\<close>
   138   - canceled source: \<^cancel>\<open>\<dots>\<close>
   139   - raw LaTeX: \<^latex>\<open>\<dots>\<close>
   140 
   141 * Outside of the inner theory body, the default presentation context is
   142 theory Pure. Thus elementary antiquotations may be used in markup
   143 commands (e.g. 'chapter', 'section', 'text') and formal comments.
   144 
   145 * System option "document_tags" specifies a default for otherwise
   146 untagged commands. This is occasionally useful to control the global
   147 visibility of commands via session options (e.g. in ROOT).
   148 
   149 * Document markup commands ('section', 'text' etc.) are implicitly
   150 tagged as "document" and visible by default. This avoids the application
   151 of option "document_tags" to these commands.
   152 
   153 * Isabelle names are mangled into LaTeX macro names to allow the full
   154 identifier syntax with underscore, prime, digits. This is relevant for
   155 antiquotations in control symbol notation, e.g. \<^const_name> becomes
   156 \isactrlconstUNDERSCOREname.
   157 
   158 * Document antiquotation @{cite} now checks the given Bibtex entries
   159 against the Bibtex database files -- only in batch-mode session builds.
   160 
   161 * Document antiquotation @{session name} checks and prints the given
   162 session name verbatim.
   163 
   164 * Document preparation with skip_proofs option now preserves the content
   165 more accurately: only terminal proof steps ('by' etc.) are skipped.
   166 
   167 * Command-line tool "isabelle document" has been re-implemented in
   168 Isabelle/Scala, with simplified arguments and explicit errors from the
   169 latex and bibtex process. Minor INCOMPATIBILITY.
   170 
   171 
   172 *** Isar ***
   173 
   174 * Command 'interpret' no longer exposes resulting theorems as literal
   175 facts, notably for the \<open>prop\<close> notation or the "fact" proof method. This
   176 improves modularity of proofs and scalability of locale interpretation.
   177 Rare INCOMPATIBILITY, need to refer to explicitly named facts instead
   178 (e.g. use 'find_theorems' or 'try' to figure this out).
   179 
   180 * Rewrites clauses (keyword 'rewrites') were moved into the locale
   181 expression syntax, where they are part of locale instances.  In
   182 interpretation commands rewrites clauses now need to occur before
   183 'for' and 'defines'.  Minor INCOMPATIBILITY.
   184 
   185 * For rewrites clauses, if activating a locale instance fails, fall
   186 back to reading the clause first.  This helps avoid qualification of
   187 locale instances where the qualifier's sole purpose is avoiding
   188 duplicate constant declarations.
   189 
   190 
   191 *** Pure ***
   192 
   193 * The inner syntax category "sort" now includes notation "_" for the
   194 dummy sort: it is effectively ignored in type-inference.
   195 
   196 
   197 *** HOL ***
   198 
   199 * Abstract bit operations as part of Main: push_bit, push_take,
   200 push_drop.
   201 
   202 * New, more general, axiomatization of complete_distrib_lattice. 
   203 The former axioms:
   204 "sup x (Inf X) = Inf (sup x ` X)" and "inf x (Sup X) = Sup (inf x ` X)"
   205 are replaced by 
   206 "Inf (Sup ` A) <= Sup (Inf ` {f ` A | f . (! Y \<in> A . f Y \<in> Y)})"
   207 The instantiations of sets and functions as complete_distrib_lattice 
   208 are moved to Hilbert_Choice.thy because their proofs need the Hilbert
   209 choice operator. The dual of this property is also proved in 
   210 Hilbert_Choice.thy.
   211 
   212 * Clarifed theorem names:
   213 
   214   Min.antimono ~> Min.subset_imp
   215   Max.antimono ~> Max.subset_imp
   216 
   217 Minor INCOMPATIBILITY.
   218 
   219 * A new command parametric_constant for proving parametricity of
   220 non-recursive definitions. For constants that are not fully parametric
   221 the command will infer conditions on relations (e.g., bi_unique,
   222 bi_total, or type class conditions such as "respects 0") sufficient for
   223 parametricity. See ~~/src/HOL/ex/Conditional_Parametricity_Examples for
   224 some examples.
   225 
   226 * SMT module:
   227   - The 'smt_oracle' option is now necessary when using the 'smt' method
   228     with a solver other than Z3. INCOMPATIBILITY.
   229   - The encoding to first-order logic is now more complete in the
   230     presence of higher-order quantifiers. An 'smt_explicit_application'
   231     option has been added to control this. INCOMPATIBILITY.
   232 
   233 * Datatypes:
   234   - The legacy command 'old_datatype', provided by
   235     '~~/src/HOL/Library/Old_Datatype.thy', has been removed. INCOMPATIBILITY.
   236 
   237 * Theory HOL-Computational_Algebra.Polynomial_Factorial does not provide
   238 instances of rat, real, complex as factorial rings etc. Import
   239 HOL-Computational_Algebra.Field_as_Ring explicitly in case of need.
   240 INCOMPATIBILITY.
   241 
   242 * Fact mod_mult_self4 (on nat) renamed to mod_mult_self3', to avoid
   243 clash with fact mod_mult_self4 (on more generic semirings).
   244 INCOMPATIBILITY.
   245 
   246 * Facts sum.commute(_restrict) and prod.commute(_restrict) renamed to
   247 sum.swap(_restrict) and prod.swap(_restrict), to avoid name clashes on
   248 interpretation of abstract locales. INCOMPATIBILITY.
   249 
   250 * Predicate pairwise_coprime abolished, use "pairwise coprime" instead.
   251 INCOMPATIBILITY.
   252 
   253 * The relator rel_filter on filters has been strengthened to its 
   254 canonical categorical definition with better properties. INCOMPATIBILITY.
   255 
   256 * HOL-Algebra: renamed (^) to [^]
   257 
   258 * Session HOL-Analysis: Moebius functions and the Riemann mapping
   259 theorem.
   260 
   261 * Class linordered_semiring_1 covers zero_less_one also, ruling out
   262 pathologic instances. Minor INCOMPATIBILITY.
   263 
   264 * Removed nat-int transfer machinery. Rare INCOMPATIBILITY.
   265 
   266 * Predicate coprime is now a real definition, not a mere
   267 abbreviation. INCOMPATIBILITY.
   268 
   269 * Code generation: Code generation takes an explicit option
   270 "case_insensitive" to accomodate case-insensitive file systems.
   271 
   272 
   273 *** System ***
   274 
   275 * The command-line tools "isabelle server" and "isabelle client" provide
   276 access to the Isabelle Server: it supports responsive session management
   277 and concurrent use of theories, based on Isabelle/PIDE infrastructure.
   278 See also the "system" manual.
   279 
   280 * The command-line tool "isabelle update_comments" normalizes formal
   281 comments in outer syntax as follows: \<comment> \<open>text\<close> (whith a single space to
   282 approximate the appearance in document output). This is more specific
   283 than former "isabelle update_cartouches -c": the latter tool option has
   284 been discontinued.
   285 
   286 * Session ROOT entry: empty 'document_files' means there is no document
   287 for this session. There is no need to specify options [document = false]
   288 anymore.
   289 
   290 * The command-line tool "isabelle mkroot" now always produces a document
   291 outline: its options have been adapted accordingly. INCOMPATIBILITY.
   292 
   293 * The command-line tool "isabelle mkroot -I" initializes a Mercurial
   294 repository for the generated session files.
   295 
   296 * Linux and Windows/Cygwin is for x86_64 only. Old 32bit platform
   297 support has been discontinued.
   298 
   299 * Mac OS X 10.10 Yosemite is now the baseline version; Mavericks is no
   300 longer supported.
   301 
   302 * Java runtime is for x86_64 only. Corresponding Isabelle settings have
   303 been renamed to ISABELLE_TOOL_JAVA_OPTIONS and JEDIT_JAVA_OPTIONS,
   304 instead of former 32/64 variants. INCOMPATIBILITY.
   305 
   306 * Command-line tool "isabelle build" supports new options:
   307   - option -B NAME: include session NAME and all descendants
   308   - option -S: only observe changes of sources, not heap images
   309   - option -f: forces a fresh build
   310 
   311 * Command-line tool "isabelle build" takes "condition" options with the
   312 corresponding environment values into account, when determining the
   313 up-to-date status of a session.
   314 
   315 * Command-line tool "isabelle imports -I" also reports actual session
   316 imports. This helps to minimize the session dependency graph.
   317 
   318 * Update to current Poly/ML 5.7.1 with slightly improved performance and
   319 PIDE markup for identifier bindings.
   320 
   321 * ISABELLE_LATEX and ISABELLE_PDFLATEX now include platform-specific
   322 options for improved error reporting. Potential INCOMPATIBILITY with
   323 unusual LaTeX installations, may have to adapt these settings.
   324 
   325 * The bundled Poly/ML 5.7.1 now uses The GNU Multiple Precision
   326 Arithmetic Library (libgmp) on all platforms, notably Mac OS X with
   327 32/64 bit.
   328 
   329 
   330 
   331 New in Isabelle2017 (October 2017)
   332 ----------------------------------
   333 
   334 *** General ***
   335 
   336 * Experimental support for Visual Studio Code (VSCode) as alternative
   337 Isabelle/PIDE front-end, see also
   338 https://marketplace.visualstudio.com/items?itemName=makarius.Isabelle2017
   339 
   340 VSCode is a new type of application that continues the concepts of
   341 "programmer's editor" and "integrated development environment" towards
   342 fully semantic editing and debugging -- in a relatively light-weight
   343 manner. Thus it fits nicely on top of the Isabelle/PIDE infrastructure.
   344 Technically, VSCode is based on the Electron application framework
   345 (Node.js + Chromium browser + V8), which is implemented in JavaScript
   346 and TypeScript, while Isabelle/VSCode mainly consists of Isabelle/Scala
   347 modules around a Language Server implementation.
   348 
   349 * Theory names are qualified by the session name that they belong to.
   350 This affects imports, but not the theory name space prefix (which is
   351 just the theory base name as before).
   352 
   353 In order to import theories from other sessions, the ROOT file format
   354 provides a new 'sessions' keyword. In contrast, a theory that is
   355 imported in the old-fashioned manner via an explicit file-system path
   356 belongs to the current session, and might cause theory name conflicts
   357 later on. Theories that are imported from other sessions are excluded
   358 from the current session document. The command-line tool "isabelle
   359 imports" helps to update theory imports.
   360 
   361 * The main theory entry points for some non-HOL sessions have changed,
   362 to avoid confusion with the global name "Main" of the session HOL. This
   363 leads to the follow renamings:
   364 
   365   CTT/Main.thy    ~>  CTT/CTT.thy
   366   ZF/Main.thy     ~>  ZF/ZF.thy
   367   ZF/Main_ZF.thy  ~>  ZF/ZF.thy
   368   ZF/Main_ZFC.thy ~>  ZF/ZFC.thy
   369   ZF/ZF.thy       ~>  ZF/ZF_Base.thy
   370 
   371 INCOMPATIBILITY.
   372 
   373 * Commands 'alias' and 'type_alias' introduce aliases for constants and
   374 type constructors, respectively. This allows adhoc changes to name-space
   375 accesses within global or local theory contexts, e.g. within a 'bundle'.
   376 
   377 * Document antiquotations @{prf} and @{full_prf} output proof terms
   378 (again) in the same way as commands 'prf' and 'full_prf'.
   379 
   380 * Computations generated by the code generator can be embedded directly
   381 into ML, alongside with @{code} antiquotations, using the following
   382 antiquotations:
   383 
   384   @{computation ... terms: ... datatypes: ...} :
   385     ((term -> term) -> 'ml option -> 'a) -> Proof.context -> term -> 'a
   386   @{computation_conv ... terms: ... datatypes: ...} :
   387     (Proof.context -> 'ml -> conv) -> Proof.context -> conv
   388   @{computation_check terms: ... datatypes: ...} : Proof.context -> conv
   389 
   390 See src/HOL/ex/Computations.thy,
   391 src/HOL/Decision_Procs/Commutative_Ring.thy and
   392 src/HOL/Decision_Procs/Reflective_Field.thy for examples and the
   393 tutorial on code generation.
   394 
   395 
   396 *** Prover IDE -- Isabelle/Scala/jEdit ***
   397 
   398 * Session-qualified theory imports allow the Prover IDE to process
   399 arbitrary theory hierarchies independently of the underlying logic
   400 session image (e.g. option "isabelle jedit -l"), but the directory
   401 structure needs to be known in advance (e.g. option "isabelle jedit -d"
   402 or a line in the file $ISABELLE_HOME_USER/ROOTS).
   403 
   404 * The PIDE document model maintains file content independently of the
   405 status of jEdit editor buffers. Reloading jEdit buffers no longer causes
   406 changes of formal document content. Theory dependencies are always
   407 resolved internally, without the need for corresponding editor buffers.
   408 The system option "jedit_auto_load" has been discontinued: it is
   409 effectively always enabled.
   410 
   411 * The Theories dockable provides a "Purge" button, in order to restrict
   412 the document model to theories that are required for open editor
   413 buffers.
   414 
   415 * The Theories dockable indicates the overall status of checking of each
   416 entry. When all forked tasks of a theory are finished, the border is
   417 painted with thick lines; remaining errors in this situation are
   418 represented by a different border color.
   419 
   420 * Automatic indentation is more careful to avoid redundant spaces in
   421 intermediate situations. Keywords are indented after input (via typed
   422 characters or completion); see also option "jedit_indent_input".
   423 
   424 * Action "isabelle.preview" opens an HTML preview of the current theory
   425 document in the default web browser.
   426 
   427 * Command-line invocation "isabelle jedit -R -l LOGIC" opens the ROOT
   428 entry of the specified logic session in the editor, while its parent is
   429 used for formal checking.
   430 
   431 * The main Isabelle/jEdit plugin may be restarted manually (using the
   432 jEdit Plugin Manager), as long as the "Isabelle Base" plugin remains
   433 enabled at all times.
   434 
   435 * Update to current jedit-5.4.0.
   436 
   437 
   438 *** Pure ***
   439 
   440 * Deleting the last code equations for a particular function using
   441 [code del] results in function with no equations (runtime abort) rather
   442 than an unimplemented function (generation time abort). Use explicit
   443 [[code drop:]] to enforce the latter. Minor INCOMPATIBILITY.
   444 
   445 * Proper concept of code declarations in code.ML:
   446   - Regular code declarations act only on the global theory level, being
   447     ignored with warnings if syntactically malformed.
   448   - Explicitly global code declarations yield errors if syntactically
   449     malformed.
   450   - Default code declarations are silently ignored if syntactically
   451     malformed.
   452 Minor INCOMPATIBILITY.
   453 
   454 * Clarified and standardized internal data bookkeeping of code
   455 declarations: history of serials allows to track potentially
   456 non-monotonous declarations appropriately. Minor INCOMPATIBILITY.
   457 
   458 
   459 *** HOL ***
   460 
   461 * The Nunchaku model finder is now part of "Main".
   462 
   463 * SMT module:
   464   - A new option, 'smt_nat_as_int', has been added to translate 'nat' to
   465     'int' and benefit from the SMT solver's theory reasoning. It is
   466     disabled by default.
   467   - The legacy module "src/HOL/Library/Old_SMT.thy" has been removed.
   468   - Several small issues have been rectified in the 'smt' command.
   469 
   470 * (Co)datatype package: The 'size_gen_o_map' lemma is no longer
   471 generated for datatypes with type class annotations. As a result, the
   472 tactic that derives it no longer fails on nested datatypes. Slight
   473 INCOMPATIBILITY.
   474 
   475 * Command and antiquotation "value" with modified default strategy:
   476 terms without free variables are always evaluated using plain evaluation
   477 only, with no fallback on normalization by evaluation. Minor
   478 INCOMPATIBILITY.
   479 
   480 * Theories "GCD" and "Binomial" are already included in "Main" (instead
   481 of "Complex_Main").
   482 
   483 * Constant "surj" is a full input/output abbreviation (again).
   484 Minor INCOMPATIBILITY.
   485 
   486 * Dropped aliasses RangeP, DomainP for Rangep, Domainp respectively.
   487 INCOMPATIBILITY.
   488 
   489 * Renamed ii to imaginary_unit in order to free up ii as a variable
   490 name. The syntax \<i> remains available. INCOMPATIBILITY.
   491 
   492 * Dropped abbreviations transP, antisymP, single_valuedP; use constants
   493 transp, antisymp, single_valuedp instead. INCOMPATIBILITY.
   494 
   495 * Constant "subseq" in Topological_Spaces has been removed -- it is
   496 subsumed by "strict_mono". Some basic lemmas specific to "subseq" have
   497 been renamed accordingly, e.g. "subseq_o" -> "strict_mono_o" etc.
   498 
   499 * Theory List: "sublist" renamed to "nths" in analogy with "nth", and
   500 "sublisteq" renamed to "subseq". Minor INCOMPATIBILITY.
   501 
   502 * Theory List: new generic function "sorted_wrt".
   503 
   504 * Named theorems mod_simps covers various congruence rules concerning
   505 mod, replacing former zmod_simps. INCOMPATIBILITY.
   506 
   507 * Swapped orientation of congruence rules mod_add_left_eq,
   508 mod_add_right_eq, mod_add_eq, mod_mult_left_eq, mod_mult_right_eq,
   509 mod_mult_eq, mod_minus_eq, mod_diff_left_eq, mod_diff_right_eq,
   510 mod_diff_eq. INCOMPATIBILITY.
   511 
   512 * Generalized some facts:
   513     measure_induct_rule
   514     measure_induct
   515     zminus_zmod ~> mod_minus_eq
   516     zdiff_zmod_left ~> mod_diff_left_eq
   517     zdiff_zmod_right ~> mod_diff_right_eq
   518     zmod_eq_dvd_iff ~> mod_eq_dvd_iff
   519 INCOMPATIBILITY.
   520 
   521 * Algebraic type class hierarchy of euclidean (semi)rings in HOL:
   522 euclidean_(semi)ring, euclidean_(semi)ring_cancel,
   523 unique_euclidean_(semi)ring; instantiation requires provision of a
   524 euclidean size.
   525 
   526 * Theory "HOL-Number_Theory.Euclidean_Algorithm" has been reworked:
   527   - Euclidean induction is available as rule eucl_induct.
   528   - Constants Euclidean_Algorithm.gcd, Euclidean_Algorithm.lcm,
   529     Euclidean_Algorithm.Gcd and Euclidean_Algorithm.Lcm allow
   530     easy instantiation of euclidean (semi)rings as GCD (semi)rings.
   531   - Coefficients obtained by extended euclidean algorithm are
   532     available as "bezout_coefficients".
   533 INCOMPATIBILITY.
   534 
   535 * Theory "Number_Theory.Totient" introduces basic notions about Euler's
   536 totient function previously hidden as solitary example in theory
   537 Residues. Definition changed so that "totient 1 = 1" in agreement with
   538 the literature. Minor INCOMPATIBILITY.
   539 
   540 * New styles in theory "HOL-Library.LaTeXsugar":
   541   - "dummy_pats" for printing equations with "_" on the lhs;
   542   - "eta_expand" for printing eta-expanded terms.
   543 
   544 * Theory "HOL-Library.Permutations": theorem bij_swap_ompose_bij has
   545 been renamed to bij_swap_compose_bij. INCOMPATIBILITY.
   546 
   547 * New theory "HOL-Library.Going_To_Filter" providing the "f going_to F"
   548 filter for describing points x such that f(x) is in the filter F.
   549 
   550 * Theory "HOL-Library.Formal_Power_Series": constants X/E/L/F have been
   551 renamed to fps_X/fps_exp/fps_ln/fps_hypergeo to avoid polluting the name
   552 space. INCOMPATIBILITY.
   553 
   554 * Theory "HOL-Library.FinFun" has been moved to AFP (again).
   555 INCOMPATIBILITY.
   556 
   557 * Theory "HOL-Library.FuncSet": some old and rarely used ASCII
   558 replacement syntax has been removed. INCOMPATIBILITY, standard syntax
   559 with symbols should be used instead. The subsequent commands help to
   560 reproduce the old forms, e.g. to simplify porting old theories:
   561 
   562 syntax (ASCII)
   563   "_PiE" :: "pttrn \<Rightarrow> 'a set \<Rightarrow> 'b set \<Rightarrow> ('a \<Rightarrow> 'b) set"  ("(3PIE _:_./ _)" 10)
   564   "_Pi"  :: "pttrn \<Rightarrow> 'a set \<Rightarrow> 'b set \<Rightarrow> ('a \<Rightarrow> 'b) set"  ("(3PI _:_./ _)" 10)
   565   "_lam" :: "pttrn \<Rightarrow> 'a set \<Rightarrow> 'a \<Rightarrow> 'b \<Rightarrow> ('a \<Rightarrow> 'b)"  ("(3%_:_./ _)" [0,0,3] 3)
   566 
   567 * Theory "HOL-Library.Multiset": the simprocs on subsets operators of
   568 multisets have been renamed:
   569 
   570   msetless_cancel_numerals ~> msetsubset_cancel
   571   msetle_cancel_numerals ~> msetsubset_eq_cancel
   572 
   573 INCOMPATIBILITY.
   574 
   575 * Theory "HOL-Library.Pattern_Aliases" provides input and output syntax
   576 for pattern aliases as known from Haskell, Scala and ML.
   577 
   578 * Theory "HOL-Library.Uprod" formalizes the type of unordered pairs.
   579 
   580 * Session HOL-Analysis: more material involving arcs, paths, covering
   581 spaces, innessential maps, retracts, infinite products, simplicial
   582 complexes. Baire Category theorem. Major results include the Jordan
   583 Curve Theorem and the Great Picard Theorem.
   584 
   585 * Session HOL-Algebra has been extended by additional lattice theory:
   586 the Knaster-Tarski fixed point theorem and Galois Connections.
   587 
   588 * Sessions HOL-Computational_Algebra and HOL-Number_Theory: new notions
   589 of squarefreeness, n-th powers, and prime powers.
   590 
   591 * Session "HOL-Computional_Algebra" covers many previously scattered
   592 theories, notably Euclidean_Algorithm, Factorial_Ring,
   593 Formal_Power_Series, Fraction_Field, Fundamental_Theorem_Algebra,
   594 Normalized_Fraction, Polynomial_FPS, Polynomial, Primes. Minor
   595 INCOMPATIBILITY.
   596 
   597 
   598 *** System ***
   599 
   600 * Isabelle/Scala: the SQL module supports access to relational
   601 databases, either as plain file (SQLite) or full-scale server
   602 (PostgreSQL via local port or remote ssh connection).
   603 
   604 * Results of "isabelle build" are recorded as SQLite database (i.e.
   605 "Application File Format" in the sense of
   606 https://www.sqlite.org/appfileformat.html). This allows systematic
   607 access via operations from module Sessions.Store in Isabelle/Scala.
   608 
   609 * System option "parallel_proofs" is 1 by default (instead of more
   610 aggressive 2). This requires less heap space and avoids burning parallel
   611 CPU cycles, while full subproof parallelization is enabled for repeated
   612 builds (according to parallel_subproofs_threshold).
   613 
   614 * System option "record_proofs" allows to change the global
   615 Proofterm.proofs variable for a session. Regular values are are 0, 1, 2;
   616 a negative value means the current state in the ML heap image remains
   617 unchanged.
   618 
   619 * Isabelle settings variable ISABELLE_SCALA_BUILD_OPTIONS has been
   620 renamed to ISABELLE_SCALAC_OPTIONS. Rare INCOMPATIBILITY.
   621 
   622 * Isabelle settings variables ISABELLE_WINDOWS_PLATFORM,
   623 ISABELLE_WINDOWS_PLATFORM32, ISABELLE_WINDOWS_PLATFORM64 indicate the
   624 native Windows platform (independently of the Cygwin installation). This
   625 is analogous to ISABELLE_PLATFORM, ISABELLE_PLATFORM32,
   626 ISABELLE_PLATFORM64.
   627 
   628 * Command-line tool "isabelle build_docker" builds a Docker image from
   629 the Isabelle application bundle for Linux. See also
   630 https://hub.docker.com/r/makarius/isabelle
   631 
   632 * Command-line tool "isabelle vscode_server" provides a Language Server
   633 Protocol implementation, e.g. for the Visual Studio Code editor. It
   634 serves as example for alternative PIDE front-ends.
   635 
   636 * Command-line tool "isabelle imports" helps to maintain theory imports
   637 wrt. session structure. Examples for the main Isabelle distribution:
   638 
   639   isabelle imports -I -a
   640   isabelle imports -U -a
   641   isabelle imports -U -i -a
   642   isabelle imports -M -a -d '~~/src/Benchmarks'
   643 
   644 
   645 
   646 New in Isabelle2016-1 (December 2016)
   647 -------------------------------------
   648 
   649 *** General ***
   650 
   651 * Splitter in proof methods "simp", "auto" and friends:
   652   - The syntax "split add" has been discontinued, use plain "split",
   653     INCOMPATIBILITY.
   654   - For situations with many conditional or case expressions, there is
   655     an alternative splitting strategy that can be much faster. It is
   656     selected by writing "split!" instead of "split". It applies safe
   657     introduction and elimination rules after each split rule. As a
   658     result the subgoal may be split into several subgoals.
   659 
   660 * Command 'bundle' provides a local theory target to define a bundle
   661 from the body of specification commands (such as 'declare',
   662 'declaration', 'notation', 'lemmas', 'lemma'). For example:
   663 
   664 bundle foo
   665 begin
   666   declare a [simp]
   667   declare b [intro]
   668 end
   669 
   670 * Command 'unbundle' is like 'include', but works within a local theory
   671 context. Unlike "context includes ... begin", the effect of 'unbundle'
   672 on the target context persists, until different declarations are given.
   673 
   674 * Simplified outer syntax: uniform category "name" includes long
   675 identifiers. Former "xname" / "nameref" / "name reference" has been
   676 discontinued.
   677 
   678 * Embedded content (e.g. the inner syntax of types, terms, props) may be
   679 delimited uniformly via cartouches. This works better than old-fashioned
   680 quotes when sub-languages are nested.
   681 
   682 * Mixfix annotations support general block properties, with syntax
   683 "(\<open>x=a y=b z \<dots>\<close>". Notable property names are "indent", "consistent",
   684 "unbreakable", "markup". The existing notation "(DIGITS" is equivalent
   685 to "(\<open>indent=DIGITS\<close>". The former notation "(00" for unbreakable blocks
   686 is superseded by "(\<open>unbreabable\<close>" --- rare INCOMPATIBILITY.
   687 
   688 * Proof method "blast" is more robust wrt. corner cases of Pure
   689 statements without object-logic judgment.
   690 
   691 * Commands 'prf' and 'full_prf' are somewhat more informative (again):
   692 proof terms are reconstructed and cleaned from administrative thm nodes.
   693 
   694 * Code generator: config option "code_timing" triggers measurements of
   695 different phases of code generation. See src/HOL/ex/Code_Timing.thy for
   696 examples.
   697 
   698 * Code generator: implicits in Scala (stemming from type class
   699 instances) are generated into companion object of corresponding type
   700 class, to resolve some situations where ambiguities may occur.
   701 
   702 * Solve direct: option "solve_direct_strict_warnings" gives explicit
   703 warnings for lemma statements with trivial proofs.
   704 
   705 
   706 *** Prover IDE -- Isabelle/Scala/jEdit ***
   707 
   708 * More aggressive flushing of machine-generated input, according to
   709 system option editor_generated_input_delay (in addition to existing
   710 editor_input_delay for regular user edits). This may affect overall PIDE
   711 reactivity and CPU usage.
   712 
   713 * Syntactic indentation according to Isabelle outer syntax. Action
   714 "indent-lines" (shortcut C+i) indents the current line according to
   715 command keywords and some command substructure. Action
   716 "isabelle.newline" (shortcut ENTER) indents the old and the new line
   717 according to command keywords only; see also option
   718 "jedit_indent_newline".
   719 
   720 * Semantic indentation for unstructured proof scripts ('apply' etc.) via
   721 number of subgoals. This requires information of ongoing document
   722 processing and may thus lag behind, when the user is editing too
   723 quickly; see also option "jedit_script_indent" and
   724 "jedit_script_indent_limit".
   725 
   726 * Refined folding mode "isabelle" based on Isar syntax: 'next' and 'qed'
   727 are treated as delimiters for fold structure; 'begin' and 'end'
   728 structure of theory specifications is treated as well.
   729 
   730 * Command 'proof' provides information about proof outline with cases,
   731 e.g. for proof methods "cases", "induct", "goal_cases".
   732 
   733 * Completion templates for commands involving "begin ... end" blocks,
   734 e.g. 'context', 'notepad'.
   735 
   736 * Sidekick parser "isabelle-context" shows nesting of context blocks
   737 according to 'begin' and 'end' structure.
   738 
   739 * Highlighting of entity def/ref positions wrt. cursor.
   740 
   741 * Action "isabelle.select-entity" (shortcut CS+ENTER) selects all
   742 occurrences of the formal entity at the caret position. This facilitates
   743 systematic renaming.
   744 
   745 * PIDE document markup works across multiple Isar commands, e.g. the
   746 results established at the end of a proof are properly identified in the
   747 theorem statement.
   748 
   749 * Cartouche abbreviations work both for " and ` to accomodate typical
   750 situations where old ASCII notation may be updated.
   751 
   752 * Dockable window "Symbols" also provides access to 'abbrevs' from the
   753 outer syntax of the current theory buffer. This provides clickable
   754 syntax templates, including entries with empty abbrevs name (which are
   755 inaccessible via keyboard completion).
   756 
   757 * IDE support for the Isabelle/Pure bootstrap process, with the
   758 following independent stages:
   759 
   760   src/Pure/ROOT0.ML
   761   src/Pure/ROOT.ML
   762   src/Pure/Pure.thy
   763   src/Pure/ML_Bootstrap.thy
   764 
   765 The ML ROOT files act like quasi-theories in the context of theory
   766 ML_Bootstrap: this allows continuous checking of all loaded ML files.
   767 The theory files are presented with a modified header to import Pure
   768 from the running Isabelle instance. Results from changed versions of
   769 each stage are *not* propagated to the next stage, and isolated from the
   770 actual Isabelle/Pure that runs the IDE itself. The sequential
   771 dependencies of the above files are only observed for batch build.
   772 
   773 * Isabelle/ML and Standard ML files are presented in Sidekick with the
   774 tree structure of section headings: this special comment format is
   775 described in "implementation" chapter 0, e.g. (*** section ***).
   776 
   777 * Additional abbreviations for syntactic completion may be specified
   778 within the theory header as 'abbrevs'. The theory syntax for 'keywords'
   779 has been simplified accordingly: optional abbrevs need to go into the
   780 new 'abbrevs' section.
   781 
   782 * Global abbreviations via $ISABELLE_HOME/etc/abbrevs and
   783 $ISABELLE_HOME_USER/etc/abbrevs are no longer supported. Minor
   784 INCOMPATIBILITY, use 'abbrevs' within theory header instead.
   785 
   786 * Action "isabelle.keymap-merge" asks the user to resolve pending
   787 Isabelle keymap changes that are in conflict with the current jEdit
   788 keymap; non-conflicting changes are always applied implicitly. This
   789 action is automatically invoked on Isabelle/jEdit startup and thus
   790 increases chances that users see new keyboard shortcuts when re-using
   791 old keymaps.
   792 
   793 * ML and document antiquotations for file-systems paths are more uniform
   794 and diverse:
   795 
   796   @{path NAME}   -- no file-system check
   797   @{file NAME}   -- check for plain file
   798   @{dir NAME}    -- check for directory
   799 
   800 Minor INCOMPATIBILITY, former uses of @{file} and @{file_unchecked} may
   801 have to be changed.
   802 
   803 
   804 *** Document preparation ***
   805 
   806 * New symbol \<circle>, e.g. for temporal operator.
   807 
   808 * New document and ML antiquotation @{locale} for locales, similar to
   809 existing antiquotation @{class}.
   810 
   811 * Mixfix annotations support delimiters like \<^control>\<open>cartouche\<close> --
   812 this allows special forms of document output.
   813 
   814 * Raw LaTeX output now works via \<^latex>\<open>...\<close> instead of raw control
   815 symbol \<^raw:...>. INCOMPATIBILITY, notably for LaTeXsugar.thy and its
   816 derivatives.
   817 
   818 * \<^raw:...> symbols are no longer supported.
   819 
   820 * Old 'header' command is no longer supported (legacy since
   821 Isabelle2015).
   822 
   823 
   824 *** Isar ***
   825 
   826 * Many specification elements support structured statements with 'if' /
   827 'for' eigen-context, e.g. 'axiomatization', 'abbreviation',
   828 'definition', 'inductive', 'function'.
   829 
   830 * Toplevel theorem statements support eigen-context notation with 'if' /
   831 'for' (in postfix), which corresponds to 'assumes' / 'fixes' in the
   832 traditional long statement form (in prefix). Local premises are called
   833 "that" or "assms", respectively. Empty premises are *not* bound in the
   834 context: INCOMPATIBILITY.
   835 
   836 * Command 'define' introduces a local (non-polymorphic) definition, with
   837 optional abstraction over local parameters. The syntax resembles
   838 'definition' and 'obtain'. It fits better into the Isar language than
   839 old 'def', which is now a legacy feature.
   840 
   841 * Command 'obtain' supports structured statements with 'if' / 'for'
   842 context.
   843 
   844 * Command '\<proof>' is an alias for 'sorry', with different
   845 typesetting. E.g. to produce proof holes in examples and documentation.
   846 
   847 * The defining position of a literal fact \<open>prop\<close> is maintained more
   848 carefully, and made accessible as hyperlink in the Prover IDE.
   849 
   850 * Commands 'finally' and 'ultimately' used to expose the result as
   851 literal fact: this accidental behaviour has been discontinued. Rare
   852 INCOMPATIBILITY, use more explicit means to refer to facts in Isar.
   853 
   854 * Command 'axiomatization' has become more restrictive to correspond
   855 better to internal axioms as singleton facts with mandatory name. Minor
   856 INCOMPATIBILITY.
   857 
   858 * Proof methods may refer to the main facts via the dynamic fact
   859 "method_facts". This is particularly useful for Eisbach method
   860 definitions.
   861 
   862 * Proof method "use" allows to modify the main facts of a given method
   863 expression, e.g.
   864 
   865   (use facts in simp)
   866   (use facts in \<open>simp add: ...\<close>)
   867 
   868 * The old proof method "default" has been removed (legacy since
   869 Isabelle2016). INCOMPATIBILITY, use "standard" instead.
   870 
   871 
   872 *** Pure ***
   873 
   874 * Pure provides basic versions of proof methods "simp" and "simp_all"
   875 that only know about meta-equality (==). Potential INCOMPATIBILITY in
   876 theory imports that merge Pure with e.g. Main of Isabelle/HOL: the order
   877 is relevant to avoid confusion of Pure.simp vs. HOL.simp.
   878 
   879 * The command 'unfolding' and proof method "unfold" include a second
   880 stage where given equations are passed through the attribute "abs_def"
   881 before rewriting. This ensures that definitions are fully expanded,
   882 regardless of the actual parameters that are provided. Rare
   883 INCOMPATIBILITY in some corner cases: use proof method (simp only:)
   884 instead, or declare [[unfold_abs_def = false]] in the proof context.
   885 
   886 * Type-inference improves sorts of newly introduced type variables for
   887 the object-logic, using its base sort (i.e. HOL.type for Isabelle/HOL).
   888 Thus terms like "f x" or "\<And>x. P x" without any further syntactic context
   889 produce x::'a::type in HOL instead of x::'a::{} in Pure. Rare
   890 INCOMPATIBILITY, need to provide explicit type constraints for Pure
   891 types where this is really intended.
   892 
   893 
   894 *** HOL ***
   895 
   896 * New proof method "argo" using the built-in Argo solver based on SMT
   897 technology. The method can be used to prove goals of quantifier-free
   898 propositional logic, goals based on a combination of quantifier-free
   899 propositional logic with equality, and goals based on a combination of
   900 quantifier-free propositional logic with linear real arithmetic
   901 including min/max/abs. See HOL/ex/Argo_Examples.thy for examples.
   902 
   903 * The new "nunchaku" command integrates the Nunchaku model finder. The
   904 tool is experimental. See ~~/src/HOL/Nunchaku/Nunchaku.thy for details.
   905 
   906 * Metis: The problem encoding has changed very slightly. This might
   907 break existing proofs. INCOMPATIBILITY.
   908 
   909 * Sledgehammer:
   910   - The MaSh relevance filter is now faster than before.
   911   - Produce syntactically correct Vampire 4.0 problem files.
   912 
   913 * (Co)datatype package:
   914   - New commands for defining corecursive functions and reasoning about
   915     them in "~~/src/HOL/Library/BNF_Corec.thy": 'corec', 'corecursive',
   916     'friend_of_corec', and 'corecursion_upto'; and 'corec_unique' proof
   917     method. See 'isabelle doc corec'.
   918   - The predicator :: ('a \<Rightarrow> bool) \<Rightarrow> 'a F \<Rightarrow> bool is now a first-class
   919     citizen in bounded natural functors.
   920   - 'primrec' now allows nested calls through the predicator in addition
   921     to the map function.
   922   - 'bnf' automatically discharges reflexive proof obligations.
   923   - 'bnf' outputs a slightly modified proof obligation expressing rel in
   924        terms of map and set
   925        (not giving a specification for rel makes this one reflexive).
   926   - 'bnf' outputs a new proof obligation expressing pred in terms of set
   927        (not giving a specification for pred makes this one reflexive).
   928     INCOMPATIBILITY: manual 'bnf' declarations may need adjustment.
   929   - Renamed lemmas:
   930       rel_prod_apply ~> rel_prod_inject
   931       pred_prod_apply ~> pred_prod_inject
   932     INCOMPATIBILITY.
   933   - The "size" plugin has been made compatible again with locales.
   934   - The theorems about "rel" and "set" may have a slightly different (but
   935     equivalent) form.
   936     INCOMPATIBILITY.
   937 
   938 * The 'coinductive' command produces a proper coinduction rule for
   939 mutual coinductive predicates. This new rule replaces the old rule,
   940 which exposed details of the internal fixpoint construction and was
   941 hard to use. INCOMPATIBILITY.
   942 
   943 * New abbreviations for negated existence (but not bounded existence):
   944 
   945   \<nexists>x. P x \<equiv> \<not> (\<exists>x. P x)
   946   \<nexists>!x. P x \<equiv> \<not> (\<exists>!x. P x)
   947 
   948 * The print mode "HOL" for ASCII syntax of binders "!", "?", "?!", "@"
   949 has been removed for output. It is retained for input only, until it is
   950 eliminated altogether.
   951 
   952 * The unique existence quantifier no longer provides 'binder' syntax,
   953 but uses syntax translations (as for bounded unique existence). Thus
   954 iterated quantification \<exists>!x y. P x y with its slightly confusing
   955 sequential meaning \<exists>!x. \<exists>!y. P x y is no longer possible. Instead,
   956 pattern abstraction admits simultaneous unique existence \<exists>!(x, y). P x y
   957 (analogous to existing notation \<exists>!(x, y)\<in>A. P x y). Potential
   958 INCOMPATIBILITY in rare situations.
   959 
   960 * Conventional syntax "%(). t" for unit abstractions. Slight syntactic
   961 INCOMPATIBILITY.
   962 
   963 * Renamed constants and corresponding theorems:
   964 
   965     setsum ~> sum
   966     setprod ~> prod
   967     listsum ~> sum_list
   968     listprod ~> prod_list
   969 
   970 INCOMPATIBILITY.
   971 
   972 * Sligthly more standardized theorem names:
   973     sgn_times ~> sgn_mult
   974     sgn_mult' ~> Real_Vector_Spaces.sgn_mult
   975     divide_zero_left ~> div_0
   976     zero_mod_left ~> mod_0
   977     divide_zero ~> div_by_0
   978     divide_1 ~> div_by_1
   979     nonzero_mult_divide_cancel_left ~> nonzero_mult_div_cancel_left
   980     div_mult_self1_is_id ~> nonzero_mult_div_cancel_left
   981     nonzero_mult_divide_cancel_right ~> nonzero_mult_div_cancel_right
   982     div_mult_self2_is_id ~> nonzero_mult_div_cancel_right
   983     is_unit_divide_mult_cancel_left ~> is_unit_div_mult_cancel_left
   984     is_unit_divide_mult_cancel_right ~> is_unit_div_mult_cancel_right
   985     mod_div_equality ~> div_mult_mod_eq
   986     mod_div_equality2 ~> mult_div_mod_eq
   987     mod_div_equality3 ~> mod_div_mult_eq
   988     mod_div_equality4 ~> mod_mult_div_eq
   989     minus_div_eq_mod ~> minus_div_mult_eq_mod
   990     minus_div_eq_mod2 ~> minus_mult_div_eq_mod
   991     minus_mod_eq_div ~> minus_mod_eq_div_mult
   992     minus_mod_eq_div2 ~> minus_mod_eq_mult_div
   993     div_mod_equality' ~> minus_mod_eq_div_mult [symmetric]
   994     mod_div_equality' ~> minus_div_mult_eq_mod [symmetric]
   995     zmod_zdiv_equality ~> mult_div_mod_eq [symmetric]
   996     zmod_zdiv_equality' ~> minus_div_mult_eq_mod [symmetric]
   997     Divides.mult_div_cancel ~> minus_mod_eq_mult_div [symmetric]
   998     mult_div_cancel ~> minus_mod_eq_mult_div [symmetric]
   999     zmult_div_cancel ~> minus_mod_eq_mult_div [symmetric]
  1000     div_1 ~> div_by_Suc_0
  1001     mod_1 ~> mod_by_Suc_0
  1002 INCOMPATIBILITY.
  1003 
  1004 * New type class "idom_abs_sgn" specifies algebraic properties
  1005 of sign and absolute value functions.  Type class "sgn_if" has
  1006 disappeared.  Slight INCOMPATIBILITY.
  1007 
  1008 * Dedicated syntax LENGTH('a) for length of types.
  1009 
  1010 * Characters (type char) are modelled as finite algebraic type
  1011 corresponding to {0..255}.
  1012 
  1013   - Logical representation:
  1014     * 0 is instantiated to the ASCII zero character.
  1015     * All other characters are represented as "Char n"
  1016       with n being a raw numeral expression less than 256.
  1017     * Expressions of the form "Char n" with n greater than 255
  1018       are non-canonical.
  1019   - Printing and parsing:
  1020     * Printable characters are printed and parsed as "CHR ''\<dots>''"
  1021       (as before).
  1022     * The ASCII zero character is printed and parsed as "0".
  1023     * All other canonical characters are printed as "CHR 0xXX"
  1024       with XX being the hexadecimal character code.  "CHR n"
  1025       is parsable for every numeral expression n.
  1026     * Non-canonical characters have no special syntax and are
  1027       printed as their logical representation.
  1028   - Explicit conversions from and to the natural numbers are
  1029     provided as char_of_nat, nat_of_char (as before).
  1030   - The auxiliary nibble type has been discontinued.
  1031 
  1032 INCOMPATIBILITY.
  1033 
  1034 * Type class "div" with operation "mod" renamed to type class "modulo"
  1035 with operation "modulo", analogously to type class "divide". This
  1036 eliminates the need to qualify any of those names in the presence of
  1037 infix "mod" syntax. INCOMPATIBILITY.
  1038 
  1039 * Statements and proofs of Knaster-Tarski fixpoint combinators lfp/gfp
  1040 have been clarified. The fixpoint properties are lfp_fixpoint, its
  1041 symmetric lfp_unfold (as before), and the duals for gfp. Auxiliary items
  1042 for the proof (lfp_lemma2 etc.) are no longer exported, but can be
  1043 easily recovered by composition with eq_refl. Minor INCOMPATIBILITY.
  1044 
  1045 * Constant "surj" is a mere input abbreviation, to avoid hiding an
  1046 equation in term output. Minor INCOMPATIBILITY.
  1047 
  1048 * Command 'code_reflect' accepts empty constructor lists for datatypes,
  1049 which renders those abstract effectively.
  1050 
  1051 * Command 'export_code' checks given constants for abstraction
  1052 violations: a small guarantee that given constants specify a safe
  1053 interface for the generated code.
  1054 
  1055 * Code generation for Scala: ambiguous implicts in class diagrams are
  1056 spelt out explicitly.
  1057 
  1058 * Static evaluators (Code_Evaluation.static_* in Isabelle/ML) rely on
  1059 explicitly provided auxiliary definitions for required type class
  1060 dictionaries rather than half-working magic. INCOMPATIBILITY, see the
  1061 tutorial on code generation for details.
  1062 
  1063 * Theory Set_Interval: substantial new theorems on indexed sums and
  1064 products.
  1065 
  1066 * Locale bijection establishes convenient default simp rules such as
  1067 "inv f (f a) = a" for total bijections.
  1068 
  1069 * Abstract locales semigroup, abel_semigroup, semilattice,
  1070 semilattice_neutr, ordering, ordering_top, semilattice_order,
  1071 semilattice_neutr_order, comm_monoid_set, semilattice_set,
  1072 semilattice_neutr_set, semilattice_order_set,
  1073 semilattice_order_neutr_set monoid_list, comm_monoid_list,
  1074 comm_monoid_list_set, comm_monoid_mset, comm_monoid_fun use boldified
  1075 syntax uniformly that does not clash with corresponding global syntax.
  1076 INCOMPATIBILITY.
  1077 
  1078 * Former locale lifting_syntax is now a bundle, which is easier to
  1079 include in a local context or theorem statement, e.g. "context includes
  1080 lifting_syntax begin ... end". Minor INCOMPATIBILITY.
  1081 
  1082 * Some old / obsolete theorems have been renamed / removed, potential
  1083 INCOMPATIBILITY.
  1084 
  1085   nat_less_cases  --  removed, use linorder_cases instead
  1086   inv_image_comp  --  removed, use image_inv_f_f instead
  1087   image_surj_f_inv_f  ~>  image_f_inv_f
  1088 
  1089 * Some theorems about groups and orders have been generalised from
  1090   groups to semi-groups that are also monoids:
  1091     le_add_same_cancel1
  1092     le_add_same_cancel2
  1093     less_add_same_cancel1
  1094     less_add_same_cancel2
  1095     add_le_same_cancel1
  1096     add_le_same_cancel2
  1097     add_less_same_cancel1
  1098     add_less_same_cancel2
  1099 
  1100 * Some simplifications theorems about rings have been removed, since
  1101   superseeded by a more general version:
  1102     less_add_cancel_left_greater_zero ~> less_add_same_cancel1
  1103     less_add_cancel_right_greater_zero ~> less_add_same_cancel2
  1104     less_eq_add_cancel_left_greater_eq_zero ~> le_add_same_cancel1
  1105     less_eq_add_cancel_right_greater_eq_zero ~> le_add_same_cancel2
  1106     less_eq_add_cancel_left_less_eq_zero ~> add_le_same_cancel1
  1107     less_eq_add_cancel_right_less_eq_zero ~> add_le_same_cancel2
  1108     less_add_cancel_left_less_zero ~> add_less_same_cancel1
  1109     less_add_cancel_right_less_zero ~> add_less_same_cancel2
  1110 INCOMPATIBILITY.
  1111 
  1112 * Renamed split_if -> if_split and split_if_asm -> if_split_asm to
  1113 resemble the f.split naming convention, INCOMPATIBILITY.
  1114 
  1115 * Added class topological_monoid.
  1116 
  1117 * The following theorems have been renamed:
  1118 
  1119   setsum_left_distrib ~> sum_distrib_right
  1120   setsum_right_distrib ~> sum_distrib_left
  1121 
  1122 INCOMPATIBILITY.
  1123 
  1124 * Compound constants INFIMUM and SUPREMUM are mere abbreviations now.
  1125 INCOMPATIBILITY.
  1126 
  1127 * "Gcd (f ` A)" and "Lcm (f ` A)" are printed with optional
  1128 comprehension-like syntax analogously to "Inf (f ` A)" and "Sup (f `
  1129 A)".
  1130 
  1131 * Class semiring_Lcd merged into semiring_Gcd. INCOMPATIBILITY.
  1132 
  1133 * The type class ordered_comm_monoid_add is now called
  1134 ordered_cancel_comm_monoid_add. A new type class ordered_comm_monoid_add
  1135 is introduced as the combination of ordered_ab_semigroup_add +
  1136 comm_monoid_add. INCOMPATIBILITY.
  1137 
  1138 * Introduced the type classes canonically_ordered_comm_monoid_add and
  1139 dioid.
  1140 
  1141 * Introduced the type class ordered_ab_semigroup_monoid_add_imp_le. When
  1142 instantiating linordered_semiring_strict and ordered_ab_group_add, an
  1143 explicit instantiation of ordered_ab_semigroup_monoid_add_imp_le might
  1144 be required. INCOMPATIBILITY.
  1145 
  1146 * Dropped various legacy fact bindings, whose replacements are often
  1147 of a more general type also:
  1148   lcm_left_commute_nat ~> lcm.left_commute
  1149   lcm_left_commute_int ~> lcm.left_commute
  1150   gcd_left_commute_nat ~> gcd.left_commute
  1151   gcd_left_commute_int ~> gcd.left_commute
  1152   gcd_greatest_iff_nat ~> gcd_greatest_iff
  1153   gcd_greatest_iff_int ~> gcd_greatest_iff
  1154   coprime_dvd_mult_nat ~> coprime_dvd_mult
  1155   coprime_dvd_mult_int ~> coprime_dvd_mult
  1156   zpower_numeral_even ~> power_numeral_even
  1157   gcd_mult_cancel_nat ~> gcd_mult_cancel
  1158   gcd_mult_cancel_int ~> gcd_mult_cancel
  1159   div_gcd_coprime_nat ~> div_gcd_coprime
  1160   div_gcd_coprime_int ~> div_gcd_coprime
  1161   zpower_numeral_odd ~> power_numeral_odd
  1162   zero_less_int_conv ~> of_nat_0_less_iff
  1163   gcd_greatest_nat ~> gcd_greatest
  1164   gcd_greatest_int ~> gcd_greatest
  1165   coprime_mult_nat ~> coprime_mult
  1166   coprime_mult_int ~> coprime_mult
  1167   lcm_commute_nat ~> lcm.commute
  1168   lcm_commute_int ~> lcm.commute
  1169   int_less_0_conv ~> of_nat_less_0_iff
  1170   gcd_commute_nat ~> gcd.commute
  1171   gcd_commute_int ~> gcd.commute
  1172   Gcd_insert_nat ~> Gcd_insert
  1173   Gcd_insert_int ~> Gcd_insert
  1174   of_int_int_eq ~> of_int_of_nat_eq
  1175   lcm_least_nat ~> lcm_least
  1176   lcm_least_int ~> lcm_least
  1177   lcm_assoc_nat ~> lcm.assoc
  1178   lcm_assoc_int ~> lcm.assoc
  1179   int_le_0_conv ~> of_nat_le_0_iff
  1180   int_eq_0_conv ~> of_nat_eq_0_iff
  1181   Gcd_empty_nat ~> Gcd_empty
  1182   Gcd_empty_int ~> Gcd_empty
  1183   gcd_assoc_nat ~> gcd.assoc
  1184   gcd_assoc_int ~> gcd.assoc
  1185   zero_zle_int ~> of_nat_0_le_iff
  1186   lcm_dvd2_nat ~> dvd_lcm2
  1187   lcm_dvd2_int ~> dvd_lcm2
  1188   lcm_dvd1_nat ~> dvd_lcm1
  1189   lcm_dvd1_int ~> dvd_lcm1
  1190   gcd_zero_nat ~> gcd_eq_0_iff
  1191   gcd_zero_int ~> gcd_eq_0_iff
  1192   gcd_dvd2_nat ~> gcd_dvd2
  1193   gcd_dvd2_int ~> gcd_dvd2
  1194   gcd_dvd1_nat ~> gcd_dvd1
  1195   gcd_dvd1_int ~> gcd_dvd1
  1196   int_numeral ~> of_nat_numeral
  1197   lcm_ac_nat ~> ac_simps
  1198   lcm_ac_int ~> ac_simps
  1199   gcd_ac_nat ~> ac_simps
  1200   gcd_ac_int ~> ac_simps
  1201   abs_int_eq ~> abs_of_nat
  1202   zless_int ~> of_nat_less_iff
  1203   zdiff_int ~> of_nat_diff
  1204   zadd_int ~> of_nat_add
  1205   int_mult ~> of_nat_mult
  1206   int_Suc ~> of_nat_Suc
  1207   inj_int ~> inj_of_nat
  1208   int_1 ~> of_nat_1
  1209   int_0 ~> of_nat_0
  1210   Lcm_empty_nat ~> Lcm_empty
  1211   Lcm_empty_int ~> Lcm_empty
  1212   Lcm_insert_nat ~> Lcm_insert
  1213   Lcm_insert_int ~> Lcm_insert
  1214   comp_fun_idem_gcd_nat ~> comp_fun_idem_gcd
  1215   comp_fun_idem_gcd_int ~> comp_fun_idem_gcd
  1216   comp_fun_idem_lcm_nat ~> comp_fun_idem_lcm
  1217   comp_fun_idem_lcm_int ~> comp_fun_idem_lcm
  1218   Lcm_eq_0 ~> Lcm_eq_0_I
  1219   Lcm0_iff ~> Lcm_0_iff
  1220   Lcm_dvd_int ~> Lcm_least
  1221   divides_mult_nat ~> divides_mult
  1222   divides_mult_int ~> divides_mult
  1223   lcm_0_nat ~> lcm_0_right
  1224   lcm_0_int ~> lcm_0_right
  1225   lcm_0_left_nat ~> lcm_0_left
  1226   lcm_0_left_int ~> lcm_0_left
  1227   dvd_gcd_D1_nat ~> dvd_gcdD1
  1228   dvd_gcd_D1_int ~> dvd_gcdD1
  1229   dvd_gcd_D2_nat ~> dvd_gcdD2
  1230   dvd_gcd_D2_int ~> dvd_gcdD2
  1231   coprime_dvd_mult_iff_nat ~> coprime_dvd_mult_iff
  1232   coprime_dvd_mult_iff_int ~> coprime_dvd_mult_iff
  1233   realpow_minus_mult ~> power_minus_mult
  1234   realpow_Suc_le_self ~> power_Suc_le_self
  1235   dvd_Gcd, dvd_Gcd_nat, dvd_Gcd_int removed in favour of Gcd_greatest
  1236 INCOMPATIBILITY.
  1237 
  1238 * Renamed HOL/Quotient_Examples/FSet.thy to
  1239 HOL/Quotient_Examples/Quotient_FSet.thy INCOMPATIBILITY.
  1240 
  1241 * Session HOL-Library: theory FinFun bundles "finfun_syntax" and
  1242 "no_finfun_syntax" allow to control optional syntax in local contexts;
  1243 this supersedes former theory FinFun_Syntax. INCOMPATIBILITY, e.g. use
  1244 "unbundle finfun_syntax" to imitate import of
  1245 "~~/src/HOL/Library/FinFun_Syntax".
  1246 
  1247 * Session HOL-Library: theory Multiset_Permutations (executably) defines
  1248 the set of permutations of a given set or multiset, i.e. the set of all
  1249 lists that contain every element of the carrier (multi-)set exactly
  1250 once.
  1251 
  1252 * Session HOL-Library: multiset membership is now expressed using
  1253 set_mset rather than count.
  1254 
  1255   - Expressions "count M a > 0" and similar simplify to membership
  1256     by default.
  1257 
  1258   - Converting between "count M a = 0" and non-membership happens using
  1259     equations count_eq_zero_iff and not_in_iff.
  1260 
  1261   - Rules count_inI and in_countE obtain facts of the form
  1262     "count M a = n" from membership.
  1263 
  1264   - Rules count_in_diffI and in_diff_countE obtain facts of the form
  1265     "count M a = n + count N a" from membership on difference sets.
  1266 
  1267 INCOMPATIBILITY.
  1268 
  1269 * Session HOL-Library: theory LaTeXsugar uses new-style "dummy_pats" for
  1270 displaying equations in functional programming style --- variables
  1271 present on the left-hand but not on the righ-hand side are replaced by
  1272 underscores.
  1273 
  1274 * Session HOL-Library: theory Combinator_PER provides combinator to
  1275 build partial equivalence relations from a predicate and an equivalence
  1276 relation.
  1277 
  1278 * Session HOL-Library: theory Perm provides basic facts about almost
  1279 everywhere fix bijections.
  1280 
  1281 * Session HOL-Library: theory Normalized_Fraction allows viewing an
  1282 element of a field of fractions as a normalized fraction (i.e. a pair of
  1283 numerator and denominator such that the two are coprime and the
  1284 denominator is normalized wrt. unit factors).
  1285 
  1286 * Session HOL-NSA has been renamed to HOL-Nonstandard_Analysis.
  1287 
  1288 * Session HOL-Multivariate_Analysis has been renamed to HOL-Analysis.
  1289 
  1290 * Session HOL-Analysis: measure theory has been moved here from
  1291 HOL-Probability. When importing HOL-Analysis some theorems need
  1292 additional name spaces prefixes due to name clashes. INCOMPATIBILITY.
  1293 
  1294 * Session HOL-Analysis: more complex analysis including Cauchy's
  1295 inequality, Liouville theorem, open mapping theorem, maximum modulus
  1296 principle, Residue theorem, Schwarz Lemma.
  1297 
  1298 * Session HOL-Analysis: Theory of polyhedra: faces, extreme points,
  1299 polytopes, and the Krein–Milman Minkowski theorem.
  1300 
  1301 * Session HOL-Analysis: Numerous results ported from the HOL Light
  1302 libraries: homeomorphisms, continuous function extensions, invariance of
  1303 domain.
  1304 
  1305 * Session HOL-Probability: the type of emeasure and nn_integral was
  1306 changed from ereal to ennreal, INCOMPATIBILITY.
  1307 
  1308   emeasure :: 'a measure \<Rightarrow> 'a set \<Rightarrow> ennreal
  1309   nn_integral :: 'a measure \<Rightarrow> ('a \<Rightarrow> ennreal) \<Rightarrow> ennreal
  1310 
  1311 * Session HOL-Probability: Code generation and QuickCheck for
  1312 Probability Mass Functions.
  1313 
  1314 * Session HOL-Probability: theory Random_Permutations contains some
  1315 theory about choosing a permutation of a set uniformly at random and
  1316 folding over a list in random order.
  1317 
  1318 * Session HOL-Probability: theory SPMF formalises discrete
  1319 subprobability distributions.
  1320 
  1321 * Session HOL-Library: the names of multiset theorems have been
  1322 normalised to distinguish which ordering the theorems are about
  1323 
  1324     mset_less_eqI ~> mset_subset_eqI
  1325     mset_less_insertD ~> mset_subset_insertD
  1326     mset_less_eq_count ~> mset_subset_eq_count
  1327     mset_less_diff_self ~> mset_subset_diff_self
  1328     mset_le_exists_conv ~> mset_subset_eq_exists_conv
  1329     mset_le_mono_add_right_cancel ~> mset_subset_eq_mono_add_right_cancel
  1330     mset_le_mono_add_left_cancel ~> mset_subset_eq_mono_add_left_cancel
  1331     mset_le_mono_add ~> mset_subset_eq_mono_add
  1332     mset_le_add_left ~> mset_subset_eq_add_left
  1333     mset_le_add_right ~> mset_subset_eq_add_right
  1334     mset_le_single ~> mset_subset_eq_single
  1335     mset_le_multiset_union_diff_commute ~> mset_subset_eq_multiset_union_diff_commute
  1336     diff_le_self ~> diff_subset_eq_self
  1337     mset_leD ~> mset_subset_eqD
  1338     mset_lessD ~> mset_subsetD
  1339     mset_le_insertD ~> mset_subset_eq_insertD
  1340     mset_less_of_empty ~> mset_subset_of_empty
  1341     mset_less_size ~> mset_subset_size
  1342     wf_less_mset_rel ~> wf_subset_mset_rel
  1343     count_le_replicate_mset_le ~> count_le_replicate_mset_subset_eq
  1344     mset_remdups_le ~> mset_remdups_subset_eq
  1345     ms_lesseq_impl ~> subset_eq_mset_impl
  1346 
  1347 Some functions have been renamed:
  1348     ms_lesseq_impl -> subset_eq_mset_impl
  1349 
  1350 * HOL-Library: multisets are now ordered with the multiset ordering
  1351     #\<subseteq># ~> \<le>
  1352     #\<subset># ~> <
  1353     le_multiset ~> less_eq_multiset
  1354     less_multiset ~> le_multiset
  1355 INCOMPATIBILITY.
  1356 
  1357 * Session HOL-Library: the prefix multiset_order has been discontinued:
  1358 the theorems can be directly accessed. As a consequence, the lemmas
  1359 "order_multiset" and "linorder_multiset" have been discontinued, and the
  1360 interpretations "multiset_linorder" and "multiset_wellorder" have been
  1361 replaced by instantiations. INCOMPATIBILITY.
  1362 
  1363 * Session HOL-Library: some theorems about the multiset ordering have
  1364 been renamed:
  1365 
  1366     le_multiset_def ~> less_eq_multiset_def
  1367     less_multiset_def ~> le_multiset_def
  1368     less_eq_imp_le_multiset ~> subset_eq_imp_le_multiset
  1369     mult_less_not_refl ~> mset_le_not_refl
  1370     mult_less_trans ~> mset_le_trans
  1371     mult_less_not_sym ~> mset_le_not_sym
  1372     mult_less_asym ~> mset_le_asym
  1373     mult_less_irrefl ~> mset_le_irrefl
  1374     union_less_mono2{,1,2} ~> union_le_mono2{,1,2}
  1375 
  1376     le_multiset\<^sub>H\<^sub>O ~> less_eq_multiset\<^sub>H\<^sub>O
  1377     le_multiset_total ~> less_eq_multiset_total
  1378     less_multiset_right_total ~> subset_eq_imp_le_multiset
  1379     le_multiset_empty_left ~> less_eq_multiset_empty_left
  1380     le_multiset_empty_right ~> less_eq_multiset_empty_right
  1381     less_multiset_empty_right ~> le_multiset_empty_left
  1382     less_multiset_empty_left ~> le_multiset_empty_right
  1383     union_less_diff_plus ~> union_le_diff_plus
  1384     ex_gt_count_imp_less_multiset ~> ex_gt_count_imp_le_multiset
  1385     less_multiset_plus_left_nonempty ~> le_multiset_plus_left_nonempty
  1386     le_multiset_plus_right_nonempty ~> le_multiset_plus_right_nonempty
  1387 INCOMPATIBILITY.
  1388 
  1389 * Session HOL-Library: the lemma mset_map has now the attribute [simp].
  1390 INCOMPATIBILITY.
  1391 
  1392 * Session HOL-Library: some theorems about multisets have been removed.
  1393 INCOMPATIBILITY, use the following replacements:
  1394 
  1395     le_multiset_plus_plus_left_iff ~> add_less_cancel_right
  1396     less_multiset_plus_plus_left_iff ~> add_less_cancel_right
  1397     le_multiset_plus_plus_right_iff ~> add_less_cancel_left
  1398     less_multiset_plus_plus_right_iff ~> add_less_cancel_left
  1399     add_eq_self_empty_iff ~> add_cancel_left_right
  1400     mset_subset_add_bothsides ~> subset_mset.add_less_cancel_right
  1401     mset_less_add_bothsides ~> subset_mset.add_less_cancel_right
  1402     mset_le_add_bothsides ~> subset_mset.add_less_cancel_right
  1403     empty_inter ~> subset_mset.inf_bot_left
  1404     inter_empty ~> subset_mset.inf_bot_right
  1405     empty_sup ~> subset_mset.sup_bot_left
  1406     sup_empty ~> subset_mset.sup_bot_right
  1407     bdd_below_multiset ~> subset_mset.bdd_above_bot
  1408     subset_eq_empty ~> subset_mset.le_zero_eq
  1409     le_empty ~> subset_mset.le_zero_eq
  1410     mset_subset_empty_nonempty ~> subset_mset.zero_less_iff_neq_zero
  1411     mset_less_empty_nonempty ~> subset_mset.zero_less_iff_neq_zero
  1412 
  1413 * Session HOL-Library: some typeclass constraints about multisets have
  1414 been reduced from ordered or linordered to preorder. Multisets have the
  1415 additional typeclasses order_bot, no_top,
  1416 ordered_ab_semigroup_add_imp_le, ordered_cancel_comm_monoid_add,
  1417 linordered_cancel_ab_semigroup_add, and
  1418 ordered_ab_semigroup_monoid_add_imp_le. INCOMPATIBILITY.
  1419 
  1420 * Session HOL-Library: there are some new simplification rules about
  1421 multisets, the multiset ordering, and the subset ordering on multisets.
  1422 INCOMPATIBILITY.
  1423 
  1424 * Session HOL-Library: the subset ordering on multisets has now the
  1425 interpretations ordered_ab_semigroup_monoid_add_imp_le and
  1426 bounded_lattice_bot. INCOMPATIBILITY.
  1427 
  1428 * Session HOL-Library, theory Multiset: single has been removed in favor
  1429 of add_mset that roughly corresponds to Set.insert. Some theorems have
  1430 removed or changed:
  1431 
  1432   single_not_empty ~> add_mset_not_empty or empty_not_add_mset
  1433   fold_mset_insert ~> fold_mset_add_mset
  1434   image_mset_insert ~> image_mset_add_mset
  1435   union_single_eq_diff
  1436   multi_self_add_other_not_self
  1437   diff_single_eq_union
  1438 INCOMPATIBILITY.
  1439 
  1440 * Session HOL-Library, theory Multiset: some theorems have been changed
  1441 to use add_mset instead of single:
  1442 
  1443   mset_add
  1444   multi_self_add_other_not_self
  1445   diff_single_eq_union
  1446   union_single_eq_diff
  1447   union_single_eq_member
  1448   add_eq_conv_diff
  1449   insert_noteq_member
  1450   add_eq_conv_ex
  1451   multi_member_split
  1452   multiset_add_sub_el_shuffle
  1453   mset_subset_eq_insertD
  1454   mset_subset_insertD
  1455   insert_subset_eq_iff
  1456   insert_union_subset_iff
  1457   multi_psub_of_add_self
  1458   inter_add_left1
  1459   inter_add_left2
  1460   inter_add_right1
  1461   inter_add_right2
  1462   sup_union_left1
  1463   sup_union_left2
  1464   sup_union_right1
  1465   sup_union_right2
  1466   size_eq_Suc_imp_eq_union
  1467   multi_nonempty_split
  1468   mset_insort
  1469   mset_update
  1470   mult1I
  1471   less_add
  1472   mset_zip_take_Cons_drop_twice
  1473   rel_mset_Zero
  1474   msed_map_invL
  1475   msed_map_invR
  1476   msed_rel_invL
  1477   msed_rel_invR
  1478   le_multiset_right_total
  1479   multiset_induct
  1480   multiset_induct2_size
  1481   multiset_induct2
  1482 INCOMPATIBILITY.
  1483 
  1484 * Session HOL-Library, theory Multiset: the definitions of some
  1485 constants have changed to use add_mset instead of adding a single
  1486 element:
  1487 
  1488   image_mset
  1489   mset
  1490   replicate_mset
  1491   mult1
  1492   pred_mset
  1493   rel_mset'
  1494   mset_insort
  1495 
  1496 INCOMPATIBILITY.
  1497 
  1498 * Session HOL-Library, theory Multiset: due to the above changes, the
  1499 attributes of some multiset theorems have been changed:
  1500 
  1501   insert_DiffM  [] ~> [simp]
  1502   insert_DiffM2 [simp] ~> []
  1503   diff_add_mset_swap [simp]
  1504   fold_mset_add_mset [simp]
  1505   diff_diff_add [simp] (for multisets only)
  1506   diff_cancel [simp] ~> []
  1507   count_single [simp] ~> []
  1508   set_mset_single [simp] ~> []
  1509   size_multiset_single [simp] ~> []
  1510   size_single [simp] ~> []
  1511   image_mset_single [simp] ~> []
  1512   mset_subset_eq_mono_add_right_cancel [simp] ~> []
  1513   mset_subset_eq_mono_add_left_cancel [simp] ~> []
  1514   fold_mset_single [simp] ~> []
  1515   subset_eq_empty [simp] ~> []
  1516   empty_sup [simp] ~> []
  1517   sup_empty [simp] ~> []
  1518   inter_empty [simp] ~> []
  1519   empty_inter [simp] ~> []
  1520 INCOMPATIBILITY.
  1521 
  1522 * Session HOL-Library, theory Multiset: the order of the variables in
  1523 the second cases of multiset_induct, multiset_induct2_size,
  1524 multiset_induct2 has been changed (e.g. Add A a ~> Add a A).
  1525 INCOMPATIBILITY.
  1526 
  1527 * Session HOL-Library, theory Multiset: there is now a simplification
  1528 procedure on multisets. It mimics the behavior of the procedure on
  1529 natural numbers. INCOMPATIBILITY.
  1530 
  1531 * Session HOL-Library, theory Multiset: renamed sums and products of
  1532 multisets:
  1533 
  1534   msetsum ~> sum_mset
  1535   msetprod ~> prod_mset
  1536 
  1537 * Session HOL-Library, theory Multiset: the notation for intersection
  1538 and union of multisets have been changed:
  1539 
  1540   #\<inter> ~> \<inter>#
  1541   #\<union> ~> \<union>#
  1542 
  1543 INCOMPATIBILITY.
  1544 
  1545 * Session HOL-Library, theory Multiset: the lemma
  1546 one_step_implies_mult_aux on multisets has been removed, use
  1547 one_step_implies_mult instead. INCOMPATIBILITY.
  1548 
  1549 * Session HOL-Library: theory Complete_Partial_Order2 provides reasoning
  1550 support for monotonicity and continuity in chain-complete partial orders
  1551 and about admissibility conditions for fixpoint inductions.
  1552 
  1553 * Session HOL-Library: theory Library/Polynomial contains also
  1554 derivation of polynomials (formerly in Library/Poly_Deriv) but not
  1555 gcd/lcm on polynomials over fields. This has been moved to a separate
  1556 theory Library/Polynomial_GCD_euclidean.thy, to pave way for a possible
  1557 future different type class instantiation for polynomials over factorial
  1558 rings. INCOMPATIBILITY.
  1559 
  1560 * Session HOL-Library: theory Sublist provides function "prefixes" with
  1561 the following renaming
  1562 
  1563   prefixeq -> prefix
  1564   prefix -> strict_prefix
  1565   suffixeq -> suffix
  1566   suffix -> strict_suffix
  1567 
  1568 Added theory of longest common prefixes.
  1569 
  1570 * Session HOL-Number_Theory: algebraic foundation for primes:
  1571 Generalisation of predicate "prime" and introduction of predicates
  1572 "prime_elem", "irreducible", a "prime_factorization" function, and the
  1573 "factorial_ring" typeclass with instance proofs for nat, int, poly. Some
  1574 theorems now have different names, most notably "prime_def" is now
  1575 "prime_nat_iff". INCOMPATIBILITY.
  1576 
  1577 * Session Old_Number_Theory has been removed, after porting remaining
  1578 theories.
  1579 
  1580 * Session HOL-Types_To_Sets provides an experimental extension of
  1581 Higher-Order Logic to allow translation of types to sets.
  1582 
  1583 
  1584 *** ML ***
  1585 
  1586 * Integer.gcd and Integer.lcm use efficient operations from the Poly/ML
  1587 library (notably for big integers). Subtle change of semantics:
  1588 Integer.gcd and Integer.lcm both normalize the sign, results are never
  1589 negative. This coincides with the definitions in HOL/GCD.thy.
  1590 INCOMPATIBILITY.
  1591 
  1592 * Structure Rat for rational numbers is now an integral part of
  1593 Isabelle/ML, with special notation @int/nat or @int for numerals (an
  1594 abbreviation for antiquotation @{Pure.rat argument}) and ML pretty
  1595 printing. Standard operations on type Rat.rat are provided via ad-hoc
  1596 overloading of + - * / < <= > >= ~ abs. INCOMPATIBILITY, need to
  1597 use + instead of +/ etc. Moreover, exception Rat.DIVZERO has been
  1598 superseded by General.Div.
  1599 
  1600 * ML antiquotation @{path} is superseded by @{file}, which ensures that
  1601 the argument is a plain file. Minor INCOMPATIBILITY.
  1602 
  1603 * Antiquotation @{make_string} is available during Pure bootstrap --
  1604 with approximative output quality.
  1605 
  1606 * Low-level ML system structures (like PolyML and RunCall) are no longer
  1607 exposed to Isabelle/ML user-space. Potential INCOMPATIBILITY.
  1608 
  1609 * The ML function "ML" provides easy access to run-time compilation.
  1610 This is particularly useful for conditional compilation, without
  1611 requiring separate files.
  1612 
  1613 * Option ML_exception_debugger controls detailed exception trace via the
  1614 Poly/ML debugger. Relevant ML modules need to be compiled beforehand
  1615 with ML_file_debug, or with ML_file and option ML_debugger enabled. Note
  1616 debugger information requires consirable time and space: main
  1617 Isabelle/HOL with full debugger support may need ML_system_64.
  1618 
  1619 * Local_Theory.restore has been renamed to Local_Theory.reset to
  1620 emphasize its disruptive impact on the cumulative context, notably the
  1621 scope of 'private' or 'qualified' names. Note that Local_Theory.reset is
  1622 only appropriate when targets are managed, e.g. starting from a global
  1623 theory and returning to it. Regular definitional packages should use
  1624 balanced blocks of Local_Theory.open_target versus
  1625 Local_Theory.close_target instead. Rare INCOMPATIBILITY.
  1626 
  1627 * Structure TimeLimit (originally from the SML/NJ library) has been
  1628 replaced by structure Timeout, with slightly different signature.
  1629 INCOMPATIBILITY.
  1630 
  1631 * Discontinued cd and pwd operations, which are not well-defined in a
  1632 multi-threaded environment. Note that files are usually located
  1633 relatively to the master directory of a theory (see also
  1634 File.full_path). Potential INCOMPATIBILITY.
  1635 
  1636 * Binding.empty_atts supersedes Thm.empty_binding and
  1637 Attrib.empty_binding. Minor INCOMPATIBILITY.
  1638 
  1639 
  1640 *** System ***
  1641 
  1642 * SML/NJ and old versions of Poly/ML are no longer supported.
  1643 
  1644 * Poly/ML heaps now follow the hierarchy of sessions, and thus require
  1645 much less disk space.
  1646 
  1647 * The Isabelle ML process is now managed directly by Isabelle/Scala, and
  1648 shell scripts merely provide optional command-line access. In
  1649 particular:
  1650 
  1651   . Scala module ML_Process to connect to the raw ML process,
  1652     with interaction via stdin/stdout/stderr or in batch mode;
  1653   . command-line tool "isabelle console" as interactive wrapper;
  1654   . command-line tool "isabelle process" as batch mode wrapper.
  1655 
  1656 * The executable "isabelle_process" has been discontinued. Tools and
  1657 prover front-ends should use ML_Process or Isabelle_Process in
  1658 Isabelle/Scala. INCOMPATIBILITY.
  1659 
  1660 * New command-line tool "isabelle process" supports ML evaluation of
  1661 literal expressions (option -e) or files (option -f) in the context of a
  1662 given heap image. Errors lead to premature exit of the ML process with
  1663 return code 1.
  1664 
  1665 * The command-line tool "isabelle build" supports option -N for cyclic
  1666 shuffling of NUMA CPU nodes. This may help performance tuning on Linux
  1667 servers with separate CPU/memory modules.
  1668 
  1669 * System option "threads" (for the size of the Isabelle/ML thread farm)
  1670 is also passed to the underlying ML runtime system as --gcthreads,
  1671 unless there is already a default provided via ML_OPTIONS settings.
  1672 
  1673 * System option "checkpoint" helps to fine-tune the global heap space
  1674 management of isabelle build. This is relevant for big sessions that may
  1675 exhaust the small 32-bit address space of the ML process (which is used
  1676 by default).
  1677 
  1678 * System option "profiling" specifies the mode for global ML profiling
  1679 in "isabelle build". Possible values are "time", "allocations". The
  1680 command-line tool "isabelle profiling_report" helps to digest the
  1681 resulting log files.
  1682 
  1683 * System option "ML_process_policy" specifies an optional command prefix
  1684 for the underlying ML process, e.g. to control CPU affinity on
  1685 multiprocessor systems. The "isabelle jedit" tool allows to override the
  1686 implicit default via option -p.
  1687 
  1688 * Command-line tool "isabelle console" provides option -r to help to
  1689 bootstrapping Isabelle/Pure interactively.
  1690 
  1691 * Command-line tool "isabelle yxml" has been discontinued.
  1692 INCOMPATIBILITY, use operations from the modules "XML" and "YXML" in
  1693 Isabelle/ML or Isabelle/Scala.
  1694 
  1695 * Many Isabelle tools that require a Java runtime system refer to the
  1696 settings ISABELLE_TOOL_JAVA_OPTIONS32 / ISABELLE_TOOL_JAVA_OPTIONS64,
  1697 depending on the underlying platform. The settings for "isabelle build"
  1698 ISABELLE_BUILD_JAVA_OPTIONS32 / ISABELLE_BUILD_JAVA_OPTIONS64 have been
  1699 discontinued. Potential INCOMPATIBILITY.
  1700 
  1701 * The Isabelle system environment always ensures that the main
  1702 executables are found within the shell search $PATH: "isabelle" and
  1703 "isabelle_scala_script".
  1704 
  1705 * Isabelle tools may consist of .scala files: the Scala compiler is
  1706 invoked on the spot. The source needs to define some object that extends
  1707 Isabelle_Tool.Body.
  1708 
  1709 * File.bash_string, File.bash_path etc. represent Isabelle/ML and
  1710 Isabelle/Scala strings authentically within GNU bash. This is useful to
  1711 produce robust shell scripts under program control, without worrying
  1712 about spaces or special characters. Note that user output works via
  1713 Path.print (ML) or Path.toString (Scala). INCOMPATIBILITY, the old (and
  1714 less versatile) operations File.shell_quote, File.shell_path etc. have
  1715 been discontinued.
  1716 
  1717 * The isabelle_java executable allows to run a Java process within the
  1718 name space of Java and Scala components that are bundled with Isabelle,
  1719 but without the Isabelle settings environment.
  1720 
  1721 * Isabelle/Scala: the SSH module supports ssh and sftp connections, for
  1722 remote command-execution and file-system access. This resembles
  1723 operations from module File and Isabelle_System to some extent. Note
  1724 that Path specifications need to be resolved remotely via
  1725 ssh.remote_path instead of File.standard_path: the implicit process
  1726 environment is different, Isabelle settings are not available remotely.
  1727 
  1728 * Isabelle/Scala: the Mercurial module supports repositories via the
  1729 regular hg command-line interface. The repositroy clone and working
  1730 directory may reside on a local or remote file-system (via ssh
  1731 connection).
  1732 
  1733 
  1734 
  1735 New in Isabelle2016 (February 2016)
  1736 -----------------------------------
  1737 
  1738 *** General ***
  1739 
  1740 * Eisbach is now based on Pure instead of HOL. Objects-logics may import
  1741 either the theory ~~/src/HOL/Eisbach/Eisbach (for HOL etc.) or
  1742 ~~/src/HOL/Eisbach/Eisbach_Old_Appl_Syntax (for FOL, ZF etc.). Note that
  1743 the HOL-Eisbach session located in ~~/src/HOL/Eisbach/ contains further
  1744 examples that do require HOL.
  1745 
  1746 * Better resource usage on all platforms (Linux, Windows, Mac OS X) for
  1747 both Isabelle/ML and Isabelle/Scala.  Slightly reduced heap space usage.
  1748 
  1749 * Former "xsymbols" syntax with Isabelle symbols is used by default,
  1750 without any special print mode. Important ASCII replacement syntax
  1751 remains available under print mode "ASCII", but less important syntax
  1752 has been removed (see below).
  1753 
  1754 * Support for more arrow symbols, with rendering in LaTeX and Isabelle
  1755 fonts: \<Lleftarrow> \<Rrightarrow> \<longlongleftarrow> \<longlongrightarrow> \<longlonglongleftarrow> \<longlonglongrightarrow>.
  1756 
  1757 * Special notation \<struct> for the first implicit 'structure' in the
  1758 context has been discontinued. Rare INCOMPATIBILITY, use explicit
  1759 structure name instead, notably in indexed notation with block-subscript
  1760 (e.g. \<odot>\<^bsub>A\<^esub>).
  1761 
  1762 * The glyph for \<diamond> in the IsabelleText font now corresponds better to its
  1763 counterpart \<box> as quantifier-like symbol. A small diamond is available as
  1764 \<diamondop>; the old symbol \<struct> loses this rendering and any special
  1765 meaning.
  1766 
  1767 * Syntax for formal comments "-- text" now also supports the symbolic
  1768 form "\<comment> text". Command-line tool "isabelle update_cartouches -c" helps
  1769 to update old sources.
  1770 
  1771 * Toplevel theorem statements have been simplified as follows:
  1772 
  1773   theorems             ~>  lemmas
  1774   schematic_lemma      ~>  schematic_goal
  1775   schematic_theorem    ~>  schematic_goal
  1776   schematic_corollary  ~>  schematic_goal
  1777 
  1778 Command-line tool "isabelle update_theorems" updates theory sources
  1779 accordingly.
  1780 
  1781 * Toplevel theorem statement 'proposition' is another alias for
  1782 'theorem'.
  1783 
  1784 * The old 'defs' command has been removed (legacy since Isabelle2014).
  1785 INCOMPATIBILITY, use regular 'definition' instead. Overloaded and/or
  1786 deferred definitions require a surrounding 'overloading' block.
  1787 
  1788 
  1789 *** Prover IDE -- Isabelle/Scala/jEdit ***
  1790 
  1791 * IDE support for the source-level debugger of Poly/ML, to work with
  1792 Isabelle/ML and official Standard ML. Option "ML_debugger" and commands
  1793 'ML_file_debug', 'ML_file_no_debug', 'SML_file_debug',
  1794 'SML_file_no_debug' control compilation of sources with or without
  1795 debugging information. The Debugger panel allows to set breakpoints (via
  1796 context menu), step through stopped threads, evaluate local ML
  1797 expressions etc. At least one Debugger view needs to be active to have
  1798 any effect on the running ML program.
  1799 
  1800 * The State panel manages explicit proof state output, with dynamic
  1801 auto-update according to cursor movement. Alternatively, the jEdit
  1802 action "isabelle.update-state" (shortcut S+ENTER) triggers manual
  1803 update.
  1804 
  1805 * The Output panel no longer shows proof state output by default, to
  1806 avoid GUI overcrowding. INCOMPATIBILITY, use the State panel instead or
  1807 enable option "editor_output_state".
  1808 
  1809 * The text overview column (status of errors, warnings etc.) is updated
  1810 asynchronously, leading to much better editor reactivity. Moreover, the
  1811 full document node content is taken into account. The width of the
  1812 column is scaled according to the main text area font, for improved
  1813 visibility.
  1814 
  1815 * The main text area no longer changes its color hue in outdated
  1816 situations. The text overview column takes over the role to indicate
  1817 unfinished edits in the PIDE pipeline. This avoids flashing text display
  1818 due to ad-hoc updates by auxiliary GUI components, such as the State
  1819 panel.
  1820 
  1821 * Slightly improved scheduling for urgent print tasks (e.g. command
  1822 state output, interactive queries) wrt. long-running background tasks.
  1823 
  1824 * Completion of symbols via prefix of \<name> or \<^name> or \name is
  1825 always possible, independently of the language context. It is never
  1826 implicit: a popup will show up unconditionally.
  1827 
  1828 * Additional abbreviations for syntactic completion may be specified in
  1829 $ISABELLE_HOME/etc/abbrevs and $ISABELLE_HOME_USER/etc/abbrevs, with
  1830 support for simple templates using ASCII 007 (bell) as placeholder.
  1831 
  1832 * Symbols \<oplus>, \<Oplus>, \<otimes>, \<Otimes>, \<odot>, \<Odot>, \<ominus>, \<oslash> no longer provide abbreviations for
  1833 completion like "+o", "*o", ".o" etc. -- due to conflicts with other
  1834 ASCII syntax. INCOMPATIBILITY, use plain backslash-completion or define
  1835 suitable abbreviations in $ISABELLE_HOME_USER/etc/abbrevs.
  1836 
  1837 * Action "isabelle-emph" (with keyboard shortcut C+e LEFT) controls
  1838 emphasized text style; the effect is visible in document output, not in
  1839 the editor.
  1840 
  1841 * Action "isabelle-reset" now uses keyboard shortcut C+e BACK_SPACE,
  1842 instead of former C+e LEFT.
  1843 
  1844 * The command-line tool "isabelle jedit" and the isabelle.Main
  1845 application wrapper treat the default $USER_HOME/Scratch.thy more
  1846 uniformly, and allow the dummy file argument ":" to open an empty buffer
  1847 instead.
  1848 
  1849 * New command-line tool "isabelle jedit_client" allows to connect to an
  1850 already running Isabelle/jEdit process. This achieves the effect of
  1851 single-instance applications seen on common GUI desktops.
  1852 
  1853 * The default look-and-feel for Linux is the traditional "Metal", which
  1854 works better with GUI scaling for very high-resolution displays (e.g.
  1855 4K). Moreover, it is generally more robust than "Nimbus".
  1856 
  1857 * Update to jedit-5.3.0, with improved GUI scaling and support of
  1858 high-resolution displays (e.g. 4K).
  1859 
  1860 * The main Isabelle executable is managed as single-instance Desktop
  1861 application uniformly on all platforms: Linux, Windows, Mac OS X.
  1862 
  1863 
  1864 *** Document preparation ***
  1865 
  1866 * Commands 'paragraph' and 'subparagraph' provide additional section
  1867 headings. Thus there are 6 levels of standard headings, as in HTML.
  1868 
  1869 * Command 'text_raw' has been clarified: input text is processed as in
  1870 'text' (with antiquotations and control symbols). The key difference is
  1871 the lack of the surrounding isabelle markup environment in output.
  1872 
  1873 * Text is structured in paragraphs and nested lists, using notation that
  1874 is similar to Markdown. The control symbols for list items are as
  1875 follows:
  1876 
  1877   \<^item>  itemize
  1878   \<^enum>  enumerate
  1879   \<^descr>  description
  1880 
  1881 * There is a new short form for antiquotations with a single argument
  1882 that is a cartouche: \<^name>\<open>...\<close> is equivalent to @{name \<open>...\<close>} and
  1883 \<open>...\<close> without control symbol is equivalent to @{cartouche \<open>...\<close>}.
  1884 \<^name> without following cartouche is equivalent to @{name}. The
  1885 standard Isabelle fonts provide glyphs to render important control
  1886 symbols, e.g. "\<^verbatim>", "\<^emph>", "\<^bold>".
  1887 
  1888 * Antiquotations @{noindent}, @{smallskip}, @{medskip}, @{bigskip} with
  1889 corresponding control symbols \<^noindent>, \<^smallskip>, \<^medskip>, \<^bigskip> specify spacing formally, using
  1890 standard LaTeX macros of the same names.
  1891 
  1892 * Antiquotation @{cartouche} in Isabelle/Pure is the same as @{text}.
  1893 Consequently, \<open>...\<close> without any decoration prints literal quasi-formal
  1894 text. Command-line tool "isabelle update_cartouches -t" helps to update
  1895 old sources, by approximative patching of the content of string and
  1896 cartouche tokens seen in theory sources.
  1897 
  1898 * The @{text} antiquotation now ignores the antiquotation option
  1899 "source". The given text content is output unconditionally, without any
  1900 surrounding quotes etc. Subtle INCOMPATIBILITY, put quotes into the
  1901 argument where they are really intended, e.g. @{text \<open>"foo"\<close>}. Initial
  1902 or terminal spaces are ignored.
  1903 
  1904 * Antiquotations @{emph} and @{bold} output LaTeX source recursively,
  1905 adding appropriate text style markup. These may be used in the short
  1906 form \<^emph>\<open>...\<close> and \<^bold>\<open>...\<close>.
  1907 
  1908 * Document antiquotation @{footnote} outputs LaTeX source recursively,
  1909 marked as \footnote{}. This may be used in the short form \<^footnote>\<open>...\<close>.
  1910 
  1911 * Antiquotation @{verbatim [display]} supports option "indent".
  1912 
  1913 * Antiquotation @{theory_text} prints uninterpreted theory source text
  1914 (Isar outer syntax with command keywords etc.). This may be used in the
  1915 short form \<^theory_text>\<open>...\<close>. @{theory_text [display]} supports option "indent".
  1916 
  1917 * Antiquotation @{doc ENTRY} provides a reference to the given
  1918 documentation, with a hyperlink in the Prover IDE.
  1919 
  1920 * Antiquotations @{command}, @{method}, @{attribute} print checked
  1921 entities of the Isar language.
  1922 
  1923 * HTML presentation uses the standard IsabelleText font and Unicode
  1924 rendering of Isabelle symbols like Isabelle/Scala/jEdit.  The former
  1925 print mode "HTML" loses its special meaning.
  1926 
  1927 
  1928 *** Isar ***
  1929 
  1930 * Local goals ('have', 'show', 'hence', 'thus') allow structured rule
  1931 statements like fixes/assumes/shows in theorem specifications, but the
  1932 notation is postfix with keywords 'if' (or 'when') and 'for'. For
  1933 example:
  1934 
  1935   have result: "C x y"
  1936     if "A x" and "B y"
  1937     for x :: 'a and y :: 'a
  1938     <proof>
  1939 
  1940 The local assumptions are bound to the name "that". The result is
  1941 exported from context of the statement as usual. The above roughly
  1942 corresponds to a raw proof block like this:
  1943 
  1944   {
  1945     fix x :: 'a and y :: 'a
  1946     assume that: "A x" "B y"
  1947     have "C x y" <proof>
  1948   }
  1949   note result = this
  1950 
  1951 The keyword 'when' may be used instead of 'if', to indicate 'presume'
  1952 instead of 'assume' above.
  1953 
  1954 * Assumptions ('assume', 'presume') allow structured rule statements
  1955 using 'if' and 'for', similar to 'have' etc. above. For example:
  1956 
  1957   assume result: "C x y"
  1958     if "A x" and "B y"
  1959     for x :: 'a and y :: 'a
  1960 
  1961 This assumes "\<And>x y::'a. A x \<Longrightarrow> B y \<Longrightarrow> C x y" and produces a general
  1962 result as usual: "A ?x \<Longrightarrow> B ?y \<Longrightarrow> C ?x ?y".
  1963 
  1964 Vacuous quantification in assumptions is omitted, i.e. a for-context
  1965 only effects propositions according to actual use of variables. For
  1966 example:
  1967 
  1968   assume "A x" and "B y" for x and y
  1969 
  1970 is equivalent to:
  1971 
  1972   assume "\<And>x. A x" and "\<And>y. B y"
  1973 
  1974 * The meaning of 'show' with Pure rule statements has changed: premises
  1975 are treated in the sense of 'assume', instead of 'presume'. This means,
  1976 a goal like "\<And>x. A x \<Longrightarrow> B x \<Longrightarrow> C x" can be solved completely as
  1977 follows:
  1978 
  1979   show "\<And>x. A x \<Longrightarrow> B x \<Longrightarrow> C x"
  1980 
  1981 or:
  1982 
  1983   show "C x" if "A x" "B x" for x
  1984 
  1985 Rare INCOMPATIBILITY, the old behaviour may be recovered as follows:
  1986 
  1987   show "C x" when "A x" "B x" for x
  1988 
  1989 * New command 'consider' states rules for generalized elimination and
  1990 case splitting. This is like a toplevel statement "theorem obtains" used
  1991 within a proof body; or like a multi-branch 'obtain' without activation
  1992 of the local context elements yet.
  1993 
  1994 * Proof method "cases" allows to specify the rule as first entry of
  1995 chained facts.  This is particularly useful with 'consider':
  1996 
  1997   consider (a) A | (b) B | (c) C <proof>
  1998   then have something
  1999   proof cases
  2000     case a
  2001     then show ?thesis <proof>
  2002   next
  2003     case b
  2004     then show ?thesis <proof>
  2005   next
  2006     case c
  2007     then show ?thesis <proof>
  2008   qed
  2009 
  2010 * Command 'case' allows fact name and attribute specification like this:
  2011 
  2012   case a: (c xs)
  2013   case a [attributes]: (c xs)
  2014 
  2015 Facts that are introduced by invoking the case context are uniformly
  2016 qualified by "a"; the same name is used for the cumulative fact. The old
  2017 form "case (c xs) [attributes]" is no longer supported. Rare
  2018 INCOMPATIBILITY, need to adapt uses of case facts in exotic situations,
  2019 and always put attributes in front.
  2020 
  2021 * The standard proof method of commands 'proof' and '..' is now called
  2022 "standard" to make semantically clear what it is; the old name "default"
  2023 is still available as legacy for some time. Documentation now explains
  2024 '..' more accurately as "by standard" instead of "by rule".
  2025 
  2026 * Nesting of Isar goal structure has been clarified: the context after
  2027 the initial backwards refinement is retained for the whole proof, within
  2028 all its context sections (as indicated via 'next'). This is e.g.
  2029 relevant for 'using', 'including', 'supply':
  2030 
  2031   have "A \<and> A" if a: A for A
  2032     supply [simp] = a
  2033   proof
  2034     show A by simp
  2035   next
  2036     show A by simp
  2037   qed
  2038 
  2039 * Command 'obtain' binds term abbreviations (via 'is' patterns) in the
  2040 proof body as well, abstracted over relevant parameters.
  2041 
  2042 * Improved type-inference for theorem statement 'obtains': separate
  2043 parameter scope for of each clause.
  2044 
  2045 * Term abbreviations via 'is' patterns also work for schematic
  2046 statements: result is abstracted over unknowns.
  2047 
  2048 * Command 'subgoal' allows to impose some structure on backward
  2049 refinements, to avoid proof scripts degenerating into long of 'apply'
  2050 sequences. Further explanations and examples are given in the isar-ref
  2051 manual.
  2052 
  2053 * Command 'supply' supports fact definitions during goal refinement
  2054 ('apply' scripts).
  2055 
  2056 * Proof method "goal_cases" turns the current subgoals into cases within
  2057 the context; the conclusion is bound to variable ?case in each case. For
  2058 example:
  2059 
  2060 lemma "\<And>x. A x \<Longrightarrow> B x \<Longrightarrow> C x"
  2061   and "\<And>y z. U y \<Longrightarrow> V z \<Longrightarrow> W y z"
  2062 proof goal_cases
  2063   case (1 x)
  2064   then show ?case using \<open>A x\<close> \<open>B x\<close> sorry
  2065 next
  2066   case (2 y z)
  2067   then show ?case using \<open>U y\<close> \<open>V z\<close> sorry
  2068 qed
  2069 
  2070 lemma "\<And>x. A x \<Longrightarrow> B x \<Longrightarrow> C x"
  2071   and "\<And>y z. U y \<Longrightarrow> V z \<Longrightarrow> W y z"
  2072 proof goal_cases
  2073   case prems: 1
  2074   then show ?case using prems sorry
  2075 next
  2076   case prems: 2
  2077   then show ?case using prems sorry
  2078 qed
  2079 
  2080 * The undocumented feature of implicit cases goal1, goal2, goal3, etc.
  2081 is marked as legacy, and will be removed eventually. The proof method
  2082 "goals" achieves a similar effect within regular Isar; often it can be
  2083 done more adequately by other means (e.g. 'consider').
  2084 
  2085 * The vacuous fact "TERM x" may be established "by fact" or as `TERM x`
  2086 as well, not just "by this" or "." as before.
  2087 
  2088 * Method "sleep" succeeds after a real-time delay (in seconds). This is
  2089 occasionally useful for demonstration and testing purposes.
  2090 
  2091 
  2092 *** Pure ***
  2093 
  2094 * Qualifiers in locale expressions default to mandatory ('!') regardless
  2095 of the command. Previously, for 'locale' and 'sublocale' the default was
  2096 optional ('?'). The old synatx '!' has been discontinued.
  2097 INCOMPATIBILITY, remove '!' and add '?' as required.
  2098 
  2099 * Keyword 'rewrites' identifies rewrite morphisms in interpretation
  2100 commands. Previously, the keyword was 'where'. INCOMPATIBILITY.
  2101 
  2102 * More gentle suppression of syntax along locale morphisms while
  2103 printing terms. Previously 'abbreviation' and 'notation' declarations
  2104 would be suppressed for morphisms except term identity. Now
  2105 'abbreviation' is also kept for morphims that only change the involved
  2106 parameters, and only 'notation' is suppressed. This can be of great help
  2107 when working with complex locale hierarchies, because proof states are
  2108 displayed much more succinctly. It also means that only notation needs
  2109 to be redeclared if desired, as illustrated by this example:
  2110 
  2111   locale struct = fixes composition :: "'a => 'a => 'a" (infixl "\<cdot>" 65)
  2112   begin
  2113     definition derived (infixl "\<odot>" 65) where ...
  2114   end
  2115 
  2116   locale morphism =
  2117     left: struct composition + right: struct composition'
  2118     for composition (infix "\<cdot>" 65) and composition' (infix "\<cdot>''" 65)
  2119   begin
  2120     notation right.derived ("\<odot>''")
  2121   end
  2122 
  2123 * Command 'global_interpretation' issues interpretations into global
  2124 theories, with optional rewrite definitions following keyword 'defines'.
  2125 
  2126 * Command 'sublocale' accepts optional rewrite definitions after keyword
  2127 'defines'.
  2128 
  2129 * Command 'permanent_interpretation' has been discontinued. Use
  2130 'global_interpretation' or 'sublocale' instead. INCOMPATIBILITY.
  2131 
  2132 * Command 'print_definitions' prints dependencies of definitional
  2133 specifications. This functionality used to be part of 'print_theory'.
  2134 
  2135 * Configuration option rule_insts_schematic has been discontinued
  2136 (intermediate legacy feature in Isabelle2015). INCOMPATIBILITY.
  2137 
  2138 * Abbreviations in type classes now carry proper sort constraint. Rare
  2139 INCOMPATIBILITY in situations where the previous misbehaviour has been
  2140 exploited.
  2141 
  2142 * Refinement of user-space type system in type classes: pseudo-local
  2143 operations behave more similar to abbreviations. Potential
  2144 INCOMPATIBILITY in exotic situations.
  2145 
  2146 
  2147 *** HOL ***
  2148 
  2149 * The 'typedef' command has been upgraded from a partially checked
  2150 "axiomatization", to a full definitional specification that takes the
  2151 global collection of overloaded constant / type definitions into
  2152 account. Type definitions with open dependencies on overloaded
  2153 definitions need to be specified as "typedef (overloaded)". This
  2154 provides extra robustness in theory construction. Rare INCOMPATIBILITY.
  2155 
  2156 * Qualification of various formal entities in the libraries is done more
  2157 uniformly via "context begin qualified definition ... end" instead of
  2158 old-style "hide_const (open) ...". Consequently, both the defined
  2159 constant and its defining fact become qualified, e.g. Option.is_none and
  2160 Option.is_none_def. Occasional INCOMPATIBILITY in applications.
  2161 
  2162 * Some old and rarely used ASCII replacement syntax has been removed.
  2163 INCOMPATIBILITY, standard syntax with symbols should be used instead.
  2164 The subsequent commands help to reproduce the old forms, e.g. to
  2165 simplify porting old theories:
  2166 
  2167   notation iff  (infixr "<->" 25)
  2168 
  2169   notation Times  (infixr "<*>" 80)
  2170 
  2171   type_notation Map.map  (infixr "~=>" 0)
  2172   notation Map.map_comp  (infixl "o'_m" 55)
  2173 
  2174   type_notation FinFun.finfun ("(_ =>f /_)" [22, 21] 21)
  2175 
  2176   notation FuncSet.funcset  (infixr "->" 60)
  2177   notation FuncSet.extensional_funcset  (infixr "->\<^sub>E" 60)
  2178 
  2179   notation Omega_Words_Fun.conc (infixr "conc" 65)
  2180 
  2181   notation Preorder.equiv ("op ~~")
  2182     and Preorder.equiv ("(_/ ~~ _)" [51, 51] 50)
  2183 
  2184   notation (in topological_space) tendsto (infixr "--->" 55)
  2185   notation (in topological_space) LIMSEQ ("((_)/ ----> (_))" [60, 60] 60)
  2186   notation LIM ("((_)/ -- (_)/ --> (_))" [60, 0, 60] 60)
  2187 
  2188   notation NSA.approx (infixl "@=" 50)
  2189   notation NSLIMSEQ ("((_)/ ----NS> (_))" [60, 60] 60)
  2190   notation NSLIM ("((_)/ -- (_)/ --NS> (_))" [60, 0, 60] 60)
  2191 
  2192 * The alternative notation "\<Colon>" for type and sort constraints has been
  2193 removed: in LaTeX document output it looks the same as "::".
  2194 INCOMPATIBILITY, use plain "::" instead.
  2195 
  2196 * Commands 'inductive' and 'inductive_set' work better when names for
  2197 intro rules are omitted: the "cases" and "induct" rules no longer
  2198 declare empty case_names, but no case_names at all. This allows to use
  2199 numbered cases in proofs, without requiring method "goal_cases".
  2200 
  2201 * Inductive definitions ('inductive', 'coinductive', etc.) expose
  2202 low-level facts of the internal construction only if the option
  2203 "inductive_internals" is enabled. This refers to the internal predicate
  2204 definition and its monotonicity result. Rare INCOMPATIBILITY.
  2205 
  2206 * Recursive function definitions ('fun', 'function', 'partial_function')
  2207 expose low-level facts of the internal construction only if the option
  2208 "function_internals" is enabled. Its internal inductive definition is
  2209 also subject to "inductive_internals". Rare INCOMPATIBILITY.
  2210 
  2211 * BNF datatypes ('datatype', 'codatatype', etc.) expose low-level facts
  2212 of the internal construction only if the option "bnf_internals" is
  2213 enabled. This supersedes the former option "bnf_note_all". Rare
  2214 INCOMPATIBILITY.
  2215 
  2216 * Combinator to represent case distinction on products is named
  2217 "case_prod", uniformly, discontinuing any input aliasses. Very popular
  2218 theorem aliasses have been retained.
  2219 
  2220 Consolidated facts:
  2221   PairE ~> prod.exhaust
  2222   Pair_eq ~> prod.inject
  2223   pair_collapse ~> prod.collapse
  2224   Pair_fst_snd_eq ~> prod_eq_iff
  2225   split_twice ~> prod.case_distrib
  2226   split_weak_cong ~> prod.case_cong_weak
  2227   split_split ~> prod.split
  2228   split_split_asm ~> prod.split_asm
  2229   splitI ~> case_prodI
  2230   splitD ~> case_prodD
  2231   splitI2 ~> case_prodI2
  2232   splitI2' ~> case_prodI2'
  2233   splitE ~> case_prodE
  2234   splitE' ~> case_prodE'
  2235   split_pair ~> case_prod_Pair
  2236   split_eta ~> case_prod_eta
  2237   split_comp ~> case_prod_comp
  2238   mem_splitI ~> mem_case_prodI
  2239   mem_splitI2 ~> mem_case_prodI2
  2240   mem_splitE ~> mem_case_prodE
  2241   The_split ~> The_case_prod
  2242   cond_split_eta ~> cond_case_prod_eta
  2243   Collect_split_in_rel_leE ~> Collect_case_prod_in_rel_leE
  2244   Collect_split_in_rel_leI ~> Collect_case_prod_in_rel_leI
  2245   in_rel_Collect_split_eq ~> in_rel_Collect_case_prod_eq
  2246   Collect_split_Grp_eqD ~> Collect_case_prod_Grp_eqD
  2247   Collect_split_Grp_inD ~> Collect_case_prod_Grp_in
  2248   Domain_Collect_split ~> Domain_Collect_case_prod
  2249   Image_Collect_split ~> Image_Collect_case_prod
  2250   Range_Collect_split ~> Range_Collect_case_prod
  2251   Eps_split ~> Eps_case_prod
  2252   Eps_split_eq ~> Eps_case_prod_eq
  2253   split_rsp ~> case_prod_rsp
  2254   curry_split ~> curry_case_prod
  2255   split_curry ~> case_prod_curry
  2256 
  2257 Changes in structure HOLogic:
  2258   split_const ~> case_prod_const
  2259   mk_split ~> mk_case_prod
  2260   mk_psplits ~> mk_ptupleabs
  2261   strip_psplits ~> strip_ptupleabs
  2262 
  2263 INCOMPATIBILITY.
  2264 
  2265 * The coercions to type 'real' have been reorganised. The function
  2266 'real' is no longer overloaded, but has type 'nat => real' and
  2267 abbreviates of_nat for that type. Also 'real_of_int :: int => real'
  2268 abbreviates of_int for that type. Other overloaded instances of 'real'
  2269 have been replaced by 'real_of_ereal' and 'real_of_float'.
  2270 
  2271 Consolidated facts (among others):
  2272   real_of_nat_le_iff -> of_nat_le_iff
  2273   real_of_nat_numeral of_nat_numeral
  2274   real_of_int_zero of_int_0
  2275   real_of_nat_zero of_nat_0
  2276   real_of_one of_int_1
  2277   real_of_int_add of_int_add
  2278   real_of_nat_add of_nat_add
  2279   real_of_int_diff of_int_diff
  2280   real_of_nat_diff of_nat_diff
  2281   floor_subtract floor_diff_of_int
  2282   real_of_int_inject of_int_eq_iff
  2283   real_of_int_gt_zero_cancel_iff of_int_0_less_iff
  2284   real_of_int_ge_zero_cancel_iff of_int_0_le_iff
  2285   real_of_nat_ge_zero of_nat_0_le_iff
  2286   real_of_int_ceiling_ge le_of_int_ceiling
  2287   ceiling_less_eq ceiling_less_iff
  2288   ceiling_le_eq ceiling_le_iff
  2289   less_floor_eq less_floor_iff
  2290   floor_less_eq floor_less_iff
  2291   floor_divide_eq_div floor_divide_of_int_eq
  2292   real_of_int_zero_cancel of_nat_eq_0_iff
  2293   ceiling_real_of_int ceiling_of_int
  2294 
  2295 INCOMPATIBILITY.
  2296 
  2297 * Theory Map: lemma map_of_is_SomeD was a clone of map_of_SomeD and has
  2298 been removed. INCOMPATIBILITY.
  2299 
  2300 * Quickcheck setup for finite sets.
  2301 
  2302 * Discontinued simp_legacy_precond. Potential INCOMPATIBILITY.
  2303 
  2304 * Sledgehammer:
  2305   - The MaSh relevance filter has been sped up.
  2306   - Proof reconstruction has been improved, to minimize the incidence of
  2307     cases where Sledgehammer gives a proof that does not work.
  2308   - Auto Sledgehammer now minimizes and preplays the results.
  2309   - Handle Vampire 4.0 proof output without raising exception.
  2310   - Eliminated "MASH" environment variable. Use the "MaSh" option in
  2311     Isabelle/jEdit instead. INCOMPATIBILITY.
  2312   - Eliminated obsolete "blocking" option and related subcommands.
  2313 
  2314 * Nitpick:
  2315   - Fixed soundness bug in translation of "finite" predicate.
  2316   - Fixed soundness bug in "destroy_constrs" optimization.
  2317   - Fixed soundness bug in translation of "rat" type.
  2318   - Removed "check_potential" and "check_genuine" options.
  2319   - Eliminated obsolete "blocking" option.
  2320 
  2321 * (Co)datatype package:
  2322   - New commands "lift_bnf" and "copy_bnf" for lifting (copying) a BNF
  2323     structure on the raw type to an abstract type defined using typedef.
  2324   - Always generate "case_transfer" theorem.
  2325   - For mutual types, generate slightly stronger "rel_induct",
  2326     "rel_coinduct", and "coinduct" theorems. INCOMPATIBILITY.
  2327   - Allow discriminators and selectors with the same name as the type
  2328     being defined.
  2329   - Avoid various internal name clashes (e.g., 'datatype f = f').
  2330 
  2331 * Transfer: new methods for interactive debugging of 'transfer' and
  2332 'transfer_prover': 'transfer_start', 'transfer_step', 'transfer_end',
  2333 'transfer_prover_start' and 'transfer_prover_end'.
  2334 
  2335 * New diagnostic command print_record for displaying record definitions.
  2336 
  2337 * Division on integers is bootstrapped directly from division on
  2338 naturals and uses generic numeral algorithm for computations. Slight
  2339 INCOMPATIBILITY, simproc numeral_divmod replaces and generalizes former
  2340 simprocs binary_int_div and binary_int_mod
  2341 
  2342 * Tightened specification of class semiring_no_zero_divisors. Minor
  2343 INCOMPATIBILITY.
  2344 
  2345 * Class algebraic_semidom introduces common algebraic notions of
  2346 integral (semi)domains, particularly units. Although logically subsumed
  2347 by fields, is is not a super class of these in order not to burden
  2348 fields with notions that are trivial there.
  2349 
  2350 * Class normalization_semidom specifies canonical representants for
  2351 equivalence classes of associated elements in an integral (semi)domain.
  2352 This formalizes associated elements as well.
  2353 
  2354 * Abstract specification of gcd/lcm operations in classes semiring_gcd,
  2355 semiring_Gcd, semiring_Lcd. Minor INCOMPATIBILITY: facts gcd_nat.commute
  2356 and gcd_int.commute are subsumed by gcd.commute, as well as
  2357 gcd_nat.assoc and gcd_int.assoc by gcd.assoc.
  2358 
  2359 * Former constants Fields.divide (_ / _) and Divides.div (_ div _) are
  2360 logically unified to Rings.divide in syntactic type class Rings.divide,
  2361 with infix syntax (_ div _). Infix syntax (_ / _) for field division is
  2362 added later as abbreviation in class Fields.inverse. INCOMPATIBILITY,
  2363 instantiations must refer to Rings.divide rather than the former
  2364 separate constants, hence infix syntax (_ / _) is usually not available
  2365 during instantiation.
  2366 
  2367 * New cancellation simprocs for boolean algebras to cancel complementary
  2368 terms for sup and inf. For example, "sup x (sup y (- x))" simplifies to
  2369 "top". INCOMPATIBILITY.
  2370 
  2371 * Class uniform_space introduces uniform spaces btw topological spaces
  2372 and metric spaces. Minor INCOMPATIBILITY: open_<type>_def needs to be
  2373 introduced in the form of an uniformity. Some constants are more general
  2374 now, it may be necessary to add type class constraints.
  2375 
  2376   open_real_def \<leadsto> open_dist
  2377   open_complex_def \<leadsto> open_dist
  2378 
  2379 * Library/Monad_Syntax: notation uses symbols \<bind> and \<then>. INCOMPATIBILITY.
  2380 
  2381 * Library/Multiset:
  2382   - Renamed multiset inclusion operators:
  2383       < ~> <#
  2384       > ~> >#
  2385       <= ~> <=#
  2386       >= ~> >=#
  2387       \<le> ~> \<le>#
  2388       \<ge> ~> \<ge>#
  2389     INCOMPATIBILITY.
  2390   - Added multiset inclusion operator syntax:
  2391       \<subset>#
  2392       \<subseteq>#
  2393       \<supset>#
  2394       \<supseteq>#
  2395   - "'a multiset" is no longer an instance of the "order",
  2396     "ordered_ab_semigroup_add_imp_le", "ordered_cancel_comm_monoid_diff",
  2397     "semilattice_inf", and "semilattice_sup" type classes. The theorems
  2398     previously provided by these type classes (directly or indirectly)
  2399     are now available through the "subset_mset" interpretation
  2400     (e.g. add_mono ~> subset_mset.add_mono).
  2401     INCOMPATIBILITY.
  2402   - Renamed conversions:
  2403       multiset_of ~> mset
  2404       multiset_of_set ~> mset_set
  2405       set_of ~> set_mset
  2406     INCOMPATIBILITY
  2407   - Renamed lemmas:
  2408       mset_le_def ~> subseteq_mset_def
  2409       mset_less_def ~> subset_mset_def
  2410       less_eq_multiset.rep_eq ~> subseteq_mset_def
  2411     INCOMPATIBILITY
  2412   - Removed lemmas generated by lift_definition:
  2413     less_eq_multiset.abs_eq, less_eq_multiset.rsp,
  2414     less_eq_multiset.transfer, less_eq_multiset_def
  2415     INCOMPATIBILITY
  2416 
  2417 * Library/Omega_Words_Fun: Infinite words modeled as functions nat \<Rightarrow> 'a.
  2418 
  2419 * Library/Bourbaki_Witt_Fixpoint: Added formalisation of the
  2420 Bourbaki-Witt fixpoint theorem for increasing functions in
  2421 chain-complete partial orders.
  2422 
  2423 * Library/Old_Recdef: discontinued obsolete 'defer_recdef' command.
  2424 Minor INCOMPATIBILITY, use 'function' instead.
  2425 
  2426 * Library/Periodic_Fun: a locale that provides convenient lemmas for
  2427 periodic functions.
  2428 
  2429 * Library/Formal_Power_Series: proper definition of division (with
  2430 remainder) for formal power series; instances for Euclidean Ring and
  2431 GCD.
  2432 
  2433 * HOL-Imperative_HOL: obsolete theory Legacy_Mrec has been removed.
  2434 
  2435 * HOL-Statespace: command 'statespace' uses mandatory qualifier for
  2436 import of parent, as for general 'locale' expressions. INCOMPATIBILITY,
  2437 remove '!' and add '?' as required.
  2438 
  2439 * HOL-Decision_Procs: The "approximation" method works with "powr"
  2440 (exponentiation on real numbers) again.
  2441 
  2442 * HOL-Multivariate_Analysis: theory Cauchy_Integral_Thm with Contour
  2443 integrals (= complex path integrals), Cauchy's integral theorem, winding
  2444 numbers and Cauchy's integral formula, Liouville theorem, Fundamental
  2445 Theorem of Algebra. Ported from HOL Light.
  2446 
  2447 * HOL-Multivariate_Analysis: topological concepts such as connected
  2448 components, homotopic paths and the inside or outside of a set.
  2449 
  2450 * HOL-Multivariate_Analysis: radius of convergence of power series and
  2451 various summability tests; Harmonic numbers and the Euler–Mascheroni
  2452 constant; the Generalised Binomial Theorem; the complex and real
  2453 Gamma/log-Gamma/Digamma/ Polygamma functions and their most important
  2454 properties.
  2455 
  2456 * HOL-Probability: The central limit theorem based on Levy's uniqueness
  2457 and continuity theorems, weak convergence, and characterisitc functions.
  2458 
  2459 * HOL-Data_Structures: new and growing session of standard data
  2460 structures.
  2461 
  2462 
  2463 *** ML ***
  2464 
  2465 * The following combinators for low-level profiling of the ML runtime
  2466 system are available:
  2467 
  2468   profile_time          (*CPU time*)
  2469   profile_time_thread   (*CPU time on this thread*)
  2470   profile_allocations   (*overall heap allocations*)
  2471 
  2472 * Antiquotation @{undefined} or \<^undefined> inlines (raise Match).
  2473 
  2474 * Antiquotation @{method NAME} inlines the (checked) name of the given
  2475 Isar proof method.
  2476 
  2477 * Pretty printing of Poly/ML compiler output in Isabelle has been
  2478 improved: proper treatment of break offsets and blocks with consistent
  2479 breaks.
  2480 
  2481 * The auxiliary module Pure/display.ML has been eliminated. Its
  2482 elementary thm print operations are now in Pure/more_thm.ML and thus
  2483 called Thm.pretty_thm, Thm.string_of_thm etc. INCOMPATIBILITY.
  2484 
  2485 * Simproc programming interfaces have been simplified:
  2486 Simplifier.make_simproc and Simplifier.define_simproc supersede various
  2487 forms of Simplifier.mk_simproc, Simplifier.simproc_global etc. Note that
  2488 term patterns for the left-hand sides are specified with implicitly
  2489 fixed variables, like top-level theorem statements. INCOMPATIBILITY.
  2490 
  2491 * Instantiation rules have been re-organized as follows:
  2492 
  2493   Thm.instantiate  (*low-level instantiation with named arguments*)
  2494   Thm.instantiate' (*version with positional arguments*)
  2495 
  2496   Drule.infer_instantiate  (*instantiation with type inference*)
  2497   Drule.infer_instantiate'  (*version with positional arguments*)
  2498 
  2499 The LHS only requires variable specifications, instead of full terms.
  2500 Old cterm_instantiate is superseded by infer_instantiate.
  2501 INCOMPATIBILITY, need to re-adjust some ML names and types accordingly.
  2502 
  2503 * Old tactic shorthands atac, rtac, etac, dtac, ftac have been
  2504 discontinued. INCOMPATIBILITY, use regular assume_tac, resolve_tac etc.
  2505 instead (with proper context).
  2506 
  2507 * Thm.instantiate (and derivatives) no longer require the LHS of the
  2508 instantiation to be certified: plain variables are given directly.
  2509 
  2510 * Subgoal.SUBPROOF and Subgoal.FOCUS combinators use anonymous
  2511 quasi-bound variables (like the Simplifier), instead of accidentally
  2512 named local fixes. This has the potential to improve stability of proof
  2513 tools, but can also cause INCOMPATIBILITY for tools that don't observe
  2514 the proof context discipline.
  2515 
  2516 * Isar proof methods are based on a slightly more general type
  2517 context_tactic, which allows to change the proof context dynamically
  2518 (e.g. to update cases) and indicate explicit Seq.Error results. Former
  2519 METHOD_CASES is superseded by CONTEXT_METHOD; further combinators are
  2520 provided in src/Pure/Isar/method.ML for convenience. INCOMPATIBILITY.
  2521 
  2522 
  2523 *** System ***
  2524 
  2525 * Command-line tool "isabelle console" enables print mode "ASCII".
  2526 
  2527 * Command-line tool "isabelle update_then" expands old Isar command
  2528 conflations:
  2529 
  2530     hence  ~>  then have
  2531     thus   ~>  then show
  2532 
  2533 This syntax is more orthogonal and improves readability and
  2534 maintainability of proofs.
  2535 
  2536 * Global session timeout is multiplied by timeout_scale factor. This
  2537 allows to adjust large-scale tests (e.g. AFP) to overall hardware
  2538 performance.
  2539 
  2540 * Property values in etc/symbols may contain spaces, if written with the
  2541 replacement character "␣" (Unicode point 0x2324). For example:
  2542 
  2543     \<star>  code: 0x0022c6  group: operator  font: Deja␣Vu␣Sans␣Mono
  2544 
  2545 * Java runtime environment for x86_64-windows allows to use larger heap
  2546 space.
  2547 
  2548 * Java runtime options are determined separately for 32bit vs. 64bit
  2549 platforms as follows.
  2550 
  2551   - Isabelle desktop application: platform-specific files that are
  2552     associated with the main app bundle
  2553 
  2554   - isabelle jedit: settings
  2555     JEDIT_JAVA_SYSTEM_OPTIONS
  2556     JEDIT_JAVA_OPTIONS32 vs. JEDIT_JAVA_OPTIONS64
  2557 
  2558   - isabelle build: settings
  2559     ISABELLE_BUILD_JAVA_OPTIONS32 vs. ISABELLE_BUILD_JAVA_OPTIONS64
  2560 
  2561 * Bash shell function "jvmpath" has been renamed to "platform_path": it
  2562 is relevant both for Poly/ML and JVM processes.
  2563 
  2564 * Poly/ML default platform architecture may be changed from 32bit to
  2565 64bit via system option ML_system_64. A system restart (and rebuild) is
  2566 required after change.
  2567 
  2568 * Poly/ML 5.6 runs natively on x86-windows and x86_64-windows, which
  2569 both allow larger heap space than former x86-cygwin.
  2570 
  2571 * Heap images are 10-15% smaller due to less wasteful persistent theory
  2572 content (using ML type theory_id instead of theory);
  2573 
  2574 
  2575 
  2576 New in Isabelle2015 (May 2015)
  2577 ------------------------------
  2578 
  2579 *** General ***
  2580 
  2581 * Local theory specification commands may have a 'private' or
  2582 'qualified' modifier to restrict name space accesses to the local scope,
  2583 as provided by some "context begin ... end" block. For example:
  2584 
  2585   context
  2586   begin
  2587 
  2588   private definition ...
  2589   private lemma ...
  2590 
  2591   qualified definition ...
  2592   qualified lemma ...
  2593 
  2594   lemma ...
  2595   theorem ...
  2596 
  2597   end
  2598 
  2599 * Command 'experiment' opens an anonymous locale context with private
  2600 naming policy.
  2601 
  2602 * Command 'notepad' requires proper nesting of begin/end and its proof
  2603 structure in the body: 'oops' is no longer supported here. Minor
  2604 INCOMPATIBILITY, use 'sorry' instead.
  2605 
  2606 * Command 'named_theorems' declares a dynamic fact within the context,
  2607 together with an attribute to maintain the content incrementally. This
  2608 supersedes functor Named_Thms in Isabelle/ML, but with a subtle change
  2609 of semantics due to external visual order vs. internal reverse order.
  2610 
  2611 * 'find_theorems': search patterns which are abstractions are
  2612 schematically expanded before search. Search results match the naive
  2613 expectation more closely, particularly wrt. abbreviations.
  2614 INCOMPATIBILITY.
  2615 
  2616 * Commands 'method_setup' and 'attribute_setup' now work within a local
  2617 theory context.
  2618 
  2619 * Outer syntax commands are managed authentically within the theory
  2620 context, without implicit global state. Potential for accidental
  2621 INCOMPATIBILITY, make sure that required theories are really imported.
  2622 
  2623 * Historical command-line terminator ";" is no longer accepted (and
  2624 already used differently in Isar). Minor INCOMPATIBILITY, use "isabelle
  2625 update_semicolons" to remove obsolete semicolons from old theory
  2626 sources.
  2627 
  2628 * Structural composition of proof methods (meth1; meth2) in Isar
  2629 corresponds to (tac1 THEN_ALL_NEW tac2) in ML.
  2630 
  2631 * The Eisbach proof method language allows to define new proof methods
  2632 by combining existing ones with their usual syntax. The "match" proof
  2633 method provides basic fact/term matching in addition to
  2634 premise/conclusion matching through Subgoal.focus, and binds fact names
  2635 from matches as well as term patterns within matches. The Isabelle
  2636 documentation provides an entry "eisbach" for the Eisbach User Manual.
  2637 Sources and various examples are in ~~/src/HOL/Eisbach/.
  2638 
  2639 
  2640 *** Prover IDE -- Isabelle/Scala/jEdit ***
  2641 
  2642 * Improved folding mode "isabelle" based on Isar syntax. Alternatively,
  2643 the "sidekick" mode may be used for document structure.
  2644 
  2645 * Extended bracket matching based on Isar language structure. System
  2646 option jedit_structure_limit determines maximum number of lines to scan
  2647 in the buffer.
  2648 
  2649 * Support for BibTeX files: context menu, context-sensitive token
  2650 marker, SideKick parser.
  2651 
  2652 * Document antiquotation @{cite} provides formal markup, which is
  2653 interpreted semi-formally based on .bib files that happen to be open in
  2654 the editor (hyperlinks, completion etc.).
  2655 
  2656 * Less waste of vertical space via negative line spacing (see Global
  2657 Options / Text Area).
  2658 
  2659 * Improved graphview panel with optional output of PNG or PDF, for
  2660 display of 'thy_deps', 'class_deps' etc.
  2661 
  2662 * The commands 'thy_deps' and 'class_deps' allow optional bounds to
  2663 restrict the visualized hierarchy.
  2664 
  2665 * Improved scheduling for asynchronous print commands (e.g. provers
  2666 managed by the Sledgehammer panel) wrt. ongoing document processing.
  2667 
  2668 
  2669 *** Document preparation ***
  2670 
  2671 * Document markup commands 'chapter', 'section', 'subsection',
  2672 'subsubsection', 'text', 'txt', 'text_raw' work uniformly in any
  2673 context, even before the initial 'theory' command. Obsolete proof
  2674 commands 'sect', 'subsect', 'subsubsect', 'txt_raw' have been
  2675 discontinued, use 'section', 'subsection', 'subsubsection', 'text_raw'
  2676 instead. The old 'header' command is still retained for some time, but
  2677 should be replaced by 'chapter', 'section' etc. (using "isabelle
  2678 update_header"). Minor INCOMPATIBILITY.
  2679 
  2680 * Official support for "tt" style variants, via \isatt{...} or
  2681 \begin{isabellett}...\end{isabellett}. The somewhat fragile \verb or
  2682 verbatim environment of LaTeX is no longer used. This allows @{ML} etc.
  2683 as argument to other macros (such as footnotes).
  2684 
  2685 * Document antiquotation @{verbatim} prints ASCII text literally in "tt"
  2686 style.
  2687 
  2688 * Discontinued obsolete option "document_graph": session_graph.pdf is
  2689 produced unconditionally for HTML browser_info and PDF-LaTeX document.
  2690 
  2691 * Diagnostic commands and document markup commands within a proof do not
  2692 affect the command tag for output. Thus commands like 'thm' are subject
  2693 to proof document structure, and no longer "stick out" accidentally.
  2694 Commands 'text' and 'txt' merely differ in the LaTeX style, not their
  2695 tags. Potential INCOMPATIBILITY in exotic situations.
  2696 
  2697 * System option "pretty_margin" is superseded by "thy_output_margin",
  2698 which is also accessible via document antiquotation option "margin".
  2699 Only the margin for document output may be changed, but not the global
  2700 pretty printing: that is 76 for plain console output, and adapted
  2701 dynamically in GUI front-ends. Implementations of document
  2702 antiquotations need to observe the margin explicitly according to
  2703 Thy_Output.string_of_margin. Minor INCOMPATIBILITY.
  2704 
  2705 * Specification of 'document_files' in the session ROOT file is
  2706 mandatory for document preparation. The legacy mode with implicit
  2707 copying of the document/ directory is no longer supported. Minor
  2708 INCOMPATIBILITY.
  2709 
  2710 
  2711 *** Pure ***
  2712 
  2713 * Proof methods with explicit instantiation ("rule_tac", "subgoal_tac"
  2714 etc.) allow an optional context of local variables ('for' declaration):
  2715 these variables become schematic in the instantiated theorem; this
  2716 behaviour is analogous to 'for' in attributes "where" and "of".
  2717 Configuration option rule_insts_schematic (default false) controls use
  2718 of schematic variables outside the context. Minor INCOMPATIBILITY,
  2719 declare rule_insts_schematic = true temporarily and update to use local
  2720 variable declarations or dummy patterns instead.
  2721 
  2722 * Explicit instantiation via attributes "where", "of", and proof methods
  2723 "rule_tac" with derivatives like "subgoal_tac" etc. admit dummy patterns
  2724 ("_") that stand for anonymous local variables.
  2725 
  2726 * Generated schematic variables in standard format of exported facts are
  2727 incremented to avoid material in the proof context. Rare
  2728 INCOMPATIBILITY, explicit instantiation sometimes needs to refer to
  2729 different index.
  2730 
  2731 * Lexical separation of signed and unsigned numerals: categories "num"
  2732 and "float" are unsigned. INCOMPATIBILITY: subtle change in precedence
  2733 of numeral signs, particularly in expressions involving infix syntax
  2734 like "(- 1) ^ n".
  2735 
  2736 * Old inner token category "xnum" has been discontinued.  Potential
  2737 INCOMPATIBILITY for exotic syntax: may use mixfix grammar with "num"
  2738 token category instead.
  2739 
  2740 
  2741 *** HOL ***
  2742 
  2743 * New (co)datatype package:
  2744   - The 'datatype_new' command has been renamed 'datatype'. The old
  2745     command of that name is now called 'old_datatype' and is provided
  2746     by "~~/src/HOL/Library/Old_Datatype.thy". See
  2747     'isabelle doc datatypes' for information on porting.
  2748     INCOMPATIBILITY.
  2749   - Renamed theorems:
  2750       disc_corec ~> corec_disc
  2751       disc_corec_iff ~> corec_disc_iff
  2752       disc_exclude ~> distinct_disc
  2753       disc_exhaust ~> exhaust_disc
  2754       disc_map_iff ~> map_disc_iff
  2755       sel_corec ~> corec_sel
  2756       sel_exhaust ~> exhaust_sel
  2757       sel_map ~> map_sel
  2758       sel_set ~> set_sel
  2759       sel_split ~> split_sel
  2760       sel_split_asm ~> split_sel_asm
  2761       strong_coinduct ~> coinduct_strong
  2762       weak_case_cong ~> case_cong_weak
  2763     INCOMPATIBILITY.
  2764   - The "no_code" option to "free_constructors", "datatype_new", and
  2765     "codatatype" has been renamed "plugins del: code".
  2766     INCOMPATIBILITY.
  2767   - The rules "set_empty" have been removed. They are easy
  2768     consequences of other set rules "by auto".
  2769     INCOMPATIBILITY.
  2770   - The rule "set_cases" is now registered with the "[cases set]"
  2771     attribute. This can influence the behavior of the "cases" proof
  2772     method when more than one case rule is applicable (e.g., an
  2773     assumption is of the form "w : set ws" and the method "cases w"
  2774     is invoked). The solution is to specify the case rule explicitly
  2775     (e.g. "cases w rule: widget.exhaust").
  2776     INCOMPATIBILITY.
  2777   - Renamed theories:
  2778       BNF_Comp ~> BNF_Composition
  2779       BNF_FP_Base ~> BNF_Fixpoint_Base
  2780       BNF_GFP ~> BNF_Greatest_Fixpoint
  2781       BNF_LFP ~> BNF_Least_Fixpoint
  2782       BNF_Constructions_on_Wellorders ~> BNF_Wellorder_Constructions
  2783       Cardinals/Constructions_on_Wellorders ~> Cardinals/Wellorder_Constructions
  2784     INCOMPATIBILITY.
  2785   - Lifting and Transfer setup for basic HOL types sum and prod (also
  2786     option) is now performed by the BNF package. Theories Lifting_Sum,
  2787     Lifting_Product and Lifting_Option from Main became obsolete and
  2788     were removed. Changed definitions of the relators rel_prod and
  2789     rel_sum (using inductive).
  2790     INCOMPATIBILITY: use rel_prod.simps and rel_sum.simps instead
  2791     of rel_prod_def and rel_sum_def.
  2792     Minor INCOMPATIBILITY: (rarely used by name) transfer theorem names
  2793     changed (e.g. map_prod_transfer ~> prod.map_transfer).
  2794   - Parametricity theorems for map functions, relators, set functions,
  2795     constructors, case combinators, discriminators, selectors and
  2796     (co)recursors are automatically proved and registered as transfer
  2797     rules.
  2798 
  2799 * Old datatype package:
  2800   - The old 'datatype' command has been renamed 'old_datatype', and
  2801     'rep_datatype' has been renamed 'old_rep_datatype'. They are
  2802     provided by "~~/src/HOL/Library/Old_Datatype.thy". See
  2803     'isabelle doc datatypes' for information on porting.
  2804     INCOMPATIBILITY.
  2805   - Renamed theorems:
  2806       weak_case_cong ~> case_cong_weak
  2807     INCOMPATIBILITY.
  2808   - Renamed theory:
  2809       ~~/src/HOL/Datatype.thy ~> ~~/src/HOL/Library/Old_Datatype.thy
  2810     INCOMPATIBILITY.
  2811 
  2812 * Nitpick:
  2813   - Fixed soundness bug related to the strict and non-strict subset
  2814     operations.
  2815 
  2816 * Sledgehammer:
  2817   - CVC4 is now included with Isabelle instead of CVC3 and run by
  2818     default.
  2819   - Z3 is now always enabled by default, now that it is fully open
  2820     source. The "z3_non_commercial" option is discontinued.
  2821   - Minimization is now always enabled by default.
  2822     Removed sub-command:
  2823       min
  2824   - Proof reconstruction, both one-liners and Isar, has been
  2825     dramatically improved.
  2826   - Improved support for CVC4 and veriT.
  2827 
  2828 * Old and new SMT modules:
  2829   - The old 'smt' method has been renamed 'old_smt' and moved to
  2830     'src/HOL/Library/Old_SMT.thy'. It is provided for compatibility,
  2831     until applications have been ported to use the new 'smt' method. For
  2832     the method to work, an older version of Z3 (e.g. Z3 3.2 or 4.0) must
  2833     be installed, and the environment variable "OLD_Z3_SOLVER" must
  2834     point to it.
  2835     INCOMPATIBILITY.
  2836   - The 'smt2' method has been renamed 'smt'.
  2837     INCOMPATIBILITY.
  2838   - New option 'smt_reconstruction_step_timeout' to limit the
  2839     reconstruction time of Z3 proof steps in the new 'smt' method.
  2840   - New option 'smt_statistics' to display statistics of the new 'smt'
  2841     method, especially runtime statistics of Z3 proof reconstruction.
  2842 
  2843 * Lifting: command 'lift_definition' allows to execute lifted constants
  2844 that have as a return type a datatype containing a subtype. This
  2845 overcomes long-time limitations in the area of code generation and
  2846 lifting, and avoids tedious workarounds.
  2847 
  2848 * Command and antiquotation "value" provide different evaluation slots
  2849 (again), where the previous strategy (NBE after ML) serves as default.
  2850 Minor INCOMPATIBILITY.
  2851 
  2852 * Add NO_MATCH-simproc, allows to check for syntactic non-equality.
  2853 
  2854 * field_simps: Use NO_MATCH-simproc for distribution rules, to avoid
  2855 non-termination in case of distributing a division. With this change
  2856 field_simps is in some cases slightly less powerful, if it fails try to
  2857 add algebra_simps, or use divide_simps. Minor INCOMPATIBILITY.
  2858 
  2859 * Separate class no_zero_divisors has been given up in favour of fully
  2860 algebraic semiring_no_zero_divisors. INCOMPATIBILITY.
  2861 
  2862 * Class linordered_semidom really requires no zero divisors.
  2863 INCOMPATIBILITY.
  2864 
  2865 * Classes division_ring, field and linordered_field always demand
  2866 "inverse 0 = 0". Given up separate classes division_ring_inverse_zero,
  2867 field_inverse_zero and linordered_field_inverse_zero. INCOMPATIBILITY.
  2868 
  2869 * Classes cancel_ab_semigroup_add / cancel_monoid_add specify explicit
  2870 additive inverse operation. INCOMPATIBILITY.
  2871 
  2872 * Complex powers and square roots. The functions "ln" and "powr" are now
  2873 overloaded for types real and complex, and 0 powr y = 0 by definition.
  2874 INCOMPATIBILITY: type constraints may be necessary.
  2875 
  2876 * The functions "sin" and "cos" are now defined for any type of sort
  2877 "{real_normed_algebra_1,banach}" type, so in particular on "real" and
  2878 "complex" uniformly. Minor INCOMPATIBILITY: type constraints may be
  2879 needed.
  2880 
  2881 * New library of properties of the complex transcendental functions sin,
  2882 cos, tan, exp, Ln, Arctan, Arcsin, Arccos. Ported from HOL Light.
  2883 
  2884 * The factorial function, "fact", now has type "nat => 'a" (of a sort
  2885 that admits numeric types including nat, int, real and complex.
  2886 INCOMPATIBILITY: an expression such as "fact 3 = 6" may require a type
  2887 constraint, and the combination "real (fact k)" is likely to be
  2888 unsatisfactory. If a type conversion is still necessary, then use
  2889 "of_nat (fact k)" or "real_of_nat (fact k)".
  2890 
  2891 * Removed functions "natfloor" and "natceiling", use "nat o floor" and
  2892 "nat o ceiling" instead. A few of the lemmas have been retained and
  2893 adapted: in their names "natfloor"/"natceiling" has been replaced by
  2894 "nat_floor"/"nat_ceiling".
  2895 
  2896 * Qualified some duplicated fact names required for boostrapping the
  2897 type class hierarchy:
  2898   ab_add_uminus_conv_diff ~> diff_conv_add_uminus
  2899   field_inverse_zero ~> inverse_zero
  2900   field_divide_inverse ~> divide_inverse
  2901   field_inverse ~> left_inverse
  2902 Minor INCOMPATIBILITY.
  2903 
  2904 * Eliminated fact duplicates:
  2905   mult_less_imp_less_right ~> mult_right_less_imp_less
  2906   mult_less_imp_less_left ~> mult_left_less_imp_less
  2907 Minor INCOMPATIBILITY.
  2908 
  2909 * Fact consolidation: even_less_0_iff is subsumed by
  2910 double_add_less_zero_iff_single_add_less_zero (simp by default anyway).
  2911 
  2912 * Generalized and consolidated some theorems concerning divsibility:
  2913   dvd_reduce ~> dvd_add_triv_right_iff
  2914   dvd_plus_eq_right ~> dvd_add_right_iff
  2915   dvd_plus_eq_left ~> dvd_add_left_iff
  2916 Minor INCOMPATIBILITY.
  2917 
  2918 * "even" and "odd" are mere abbreviations for "2 dvd _" and "~ 2 dvd _"
  2919 and part of theory Main.
  2920   even_def ~> even_iff_mod_2_eq_zero
  2921 INCOMPATIBILITY.
  2922 
  2923 * Lemma name consolidation: divide_Numeral1 ~> divide_numeral_1. Minor
  2924 INCOMPATIBILITY.
  2925 
  2926 * Bootstrap of listsum as special case of abstract product over lists.
  2927 Fact rename:
  2928     listsum_def ~> listsum.eq_foldr
  2929 INCOMPATIBILITY.
  2930 
  2931 * Product over lists via constant "listprod".
  2932 
  2933 * Theory List: renamed drop_Suc_conv_tl and nth_drop' to
  2934 Cons_nth_drop_Suc.
  2935 
  2936 * New infrastructure for compiling, running, evaluating and testing
  2937 generated code in target languages in HOL/Library/Code_Test. See
  2938 HOL/Codegenerator_Test/Code_Test* for examples.
  2939 
  2940 * Library/Multiset:
  2941   - Introduced "replicate_mset" operation.
  2942   - Introduced alternative characterizations of the multiset ordering in
  2943     "Library/Multiset_Order".
  2944   - Renamed multiset ordering:
  2945       <# ~> #<#
  2946       <=# ~> #<=#
  2947       \<subset># ~> #\<subset>#
  2948       \<subseteq># ~> #\<subseteq>#
  2949     INCOMPATIBILITY.
  2950   - Introduced abbreviations for ill-named multiset operations:
  2951       <#, \<subset># abbreviate < (strict subset)
  2952       <=#, \<le>#, \<subseteq># abbreviate <= (subset or equal)
  2953     INCOMPATIBILITY.
  2954   - Renamed
  2955       in_multiset_of ~> in_multiset_in_set
  2956       Multiset.fold ~> fold_mset
  2957       Multiset.filter ~> filter_mset
  2958     INCOMPATIBILITY.
  2959   - Removed mcard, is equal to size.
  2960   - Added attributes:
  2961       image_mset.id [simp]
  2962       image_mset_id [simp]
  2963       elem_multiset_of_set [simp, intro]
  2964       comp_fun_commute_plus_mset [simp]
  2965       comp_fun_commute.fold_mset_insert [OF comp_fun_commute_plus_mset, simp]
  2966       in_mset_fold_plus_iff [iff]
  2967       set_of_Union_mset [simp]
  2968       in_Union_mset_iff [iff]
  2969     INCOMPATIBILITY.
  2970 
  2971 * Library/Sum_of_Squares: simplified and improved "sos" method. Always
  2972 use local CSDP executable, which is much faster than the NEOS server.
  2973 The "sos_cert" functionality is invoked as "sos" with additional
  2974 argument. Minor INCOMPATIBILITY.
  2975 
  2976 * HOL-Decision_Procs: New counterexample generator quickcheck
  2977 [approximation] for inequalities of transcendental functions. Uses
  2978 hardware floating point arithmetic to randomly discover potential
  2979 counterexamples. Counterexamples are certified with the "approximation"
  2980 method. See HOL/Decision_Procs/ex/Approximation_Quickcheck_Ex.thy for
  2981 examples.
  2982 
  2983 * HOL-Probability: Reworked measurability prover
  2984   - applies destructor rules repeatedly
  2985   - removed application splitting (replaced by destructor rule)
  2986   - added congruence rules to rewrite measure spaces under the sets
  2987     projection
  2988 
  2989 * New proof method "rewrite" (in theory ~~/src/HOL/Library/Rewrite) for
  2990 single-step rewriting with subterm selection based on patterns.
  2991 
  2992 
  2993 *** ML ***
  2994 
  2995 * Subtle change of name space policy: undeclared entries are now
  2996 considered inaccessible, instead of accessible via the fully-qualified
  2997 internal name. This mainly affects Name_Space.intern (and derivatives),
  2998 which may produce an unexpected Long_Name.hidden prefix. Note that
  2999 contemporary applications use the strict Name_Space.check (and
  3000 derivatives) instead, which is not affected by the change. Potential
  3001 INCOMPATIBILITY in rare applications of Name_Space.intern.
  3002 
  3003 * Subtle change of error semantics of Toplevel.proof_of: regular user
  3004 ERROR instead of internal Toplevel.UNDEF.
  3005 
  3006 * Basic combinators map, fold, fold_map, split_list, apply are available
  3007 as parameterized antiquotations, e.g. @{map 4} for lists of quadruples.
  3008 
  3009 * Renamed "pairself" to "apply2", in accordance to @{apply 2}.
  3010 INCOMPATIBILITY.
  3011 
  3012 * Former combinators NAMED_CRITICAL and CRITICAL for central critical
  3013 sections have been discontinued, in favour of the more elementary
  3014 Multithreading.synchronized and its high-level derivative
  3015 Synchronized.var (which is usually sufficient in applications). Subtle
  3016 INCOMPATIBILITY: synchronized access needs to be atomic and cannot be
  3017 nested.
  3018 
  3019 * Synchronized.value (ML) is actually synchronized (as in Scala): subtle
  3020 change of semantics with minimal potential for INCOMPATIBILITY.
  3021 
  3022 * The main operations to certify logical entities are Thm.ctyp_of and
  3023 Thm.cterm_of with a local context; old-style global theory variants are
  3024 available as Thm.global_ctyp_of and Thm.global_cterm_of.
  3025 INCOMPATIBILITY.
  3026 
  3027 * Elementary operations in module Thm are no longer pervasive.
  3028 INCOMPATIBILITY, need to use qualified Thm.prop_of, Thm.cterm_of,
  3029 Thm.term_of etc.
  3030 
  3031 * Proper context for various elementary tactics: assume_tac,
  3032 resolve_tac, eresolve_tac, dresolve_tac, forward_tac, match_tac,
  3033 compose_tac, Splitter.split_tac etc. INCOMPATIBILITY.
  3034 
  3035 * Tactical PARALLEL_ALLGOALS is the most common way to refer to
  3036 PARALLEL_GOALS.
  3037 
  3038 * Goal.prove_multi is superseded by the fully general Goal.prove_common,
  3039 which also allows to specify a fork priority.
  3040 
  3041 * Antiquotation @{command_spec "COMMAND"} is superseded by
  3042 @{command_keyword COMMAND} (usually without quotes and with PIDE
  3043 markup). Minor INCOMPATIBILITY.
  3044 
  3045 * Cartouches within ML sources are turned into values of type
  3046 Input.source (with formal position information).
  3047 
  3048 
  3049 *** System ***
  3050 
  3051 * The Isabelle tool "update_cartouches" changes theory files to use
  3052 cartouches instead of old-style {* verbatim *} or `alt_string` tokens.
  3053 
  3054 * The Isabelle tool "build" provides new options -X, -k, -x.
  3055 
  3056 * Discontinued old-fashioned "codegen" tool. Code generation can always
  3057 be externally triggered using an appropriate ROOT file plus a
  3058 corresponding theory. Parametrization is possible using environment
  3059 variables, or ML snippets in the most extreme cases. Minor
  3060 INCOMPATIBILITY.
  3061 
  3062 * JVM system property "isabelle.threads" determines size of Scala thread
  3063 pool, like Isabelle system option "threads" for ML.
  3064 
  3065 * JVM system property "isabelle.laf" determines the default Swing
  3066 look-and-feel, via internal class name or symbolic name as in the jEdit
  3067 menu Global Options / Appearance.
  3068 
  3069 * Support for Proof General and Isar TTY loop has been discontinued.
  3070 Minor INCOMPATIBILITY, use standard PIDE infrastructure instead.
  3071 
  3072 
  3073 
  3074 New in Isabelle2014 (August 2014)
  3075 ---------------------------------
  3076 
  3077 *** General ***
  3078 
  3079 * Support for official Standard ML within the Isabelle context.
  3080 Command 'SML_file' reads and evaluates the given Standard ML file.
  3081 Toplevel bindings are stored within the theory context; the initial
  3082 environment is restricted to the Standard ML implementation of
  3083 Poly/ML, without the add-ons of Isabelle/ML.  Commands 'SML_import'
  3084 and 'SML_export' allow to exchange toplevel bindings between the two
  3085 separate environments.  See also ~~/src/Tools/SML/Examples.thy for
  3086 some examples.
  3087 
  3088 * Standard tactics and proof methods such as "clarsimp", "auto" and
  3089 "safe" now preserve equality hypotheses "x = expr" where x is a free
  3090 variable.  Locale assumptions and chained facts containing "x"
  3091 continue to be useful.  The new method "hypsubst_thin" and the
  3092 configuration option "hypsubst_thin" (within the attribute name space)
  3093 restore the previous behavior.  INCOMPATIBILITY, especially where
  3094 induction is done after these methods or when the names of free and
  3095 bound variables clash.  As first approximation, old proofs may be
  3096 repaired by "using [[hypsubst_thin = true]]" in the critical spot.
  3097 
  3098 * More static checking of proof methods, which allows the system to
  3099 form a closure over the concrete syntax.  Method arguments should be
  3100 processed in the original proof context as far as possible, before
  3101 operating on the goal state.  In any case, the standard discipline for
  3102 subgoal-addressing needs to be observed: no subgoals or a subgoal
  3103 number that is out of range produces an empty result sequence, not an
  3104 exception.  Potential INCOMPATIBILITY for non-conformant tactical
  3105 proof tools.
  3106 
  3107 * Lexical syntax (inner and outer) supports text cartouches with
  3108 arbitrary nesting, and without escapes of quotes etc.  The Prover IDE
  3109 supports input via ` (backquote).
  3110 
  3111 * The outer syntax categories "text" (for formal comments and document
  3112 markup commands) and "altstring" (for literal fact references) allow
  3113 cartouches as well, in addition to the traditional mix of quotations.
  3114 
  3115 * Syntax of document antiquotation @{rail} now uses \<newline> instead
  3116 of "\\", to avoid the optical illusion of escaped backslash within
  3117 string token.  General renovation of its syntax using text cartouches.
  3118 Minor INCOMPATIBILITY.
  3119 
  3120 * Discontinued legacy_isub_isup, which was a temporary workaround for
  3121 Isabelle/ML in Isabelle2013-1.  The prover process no longer accepts
  3122 old identifier syntax with \<^isub> or \<^isup>.  Potential
  3123 INCOMPATIBILITY.
  3124 
  3125 * Document antiquotation @{url} produces markup for the given URL,
  3126 which results in an active hyperlink within the text.
  3127 
  3128 * Document antiquotation @{file_unchecked} is like @{file}, but does
  3129 not check existence within the file-system.
  3130 
  3131 * Updated and extended manuals: codegen, datatypes, implementation,
  3132 isar-ref, jedit, system.
  3133 
  3134 
  3135 *** Prover IDE -- Isabelle/Scala/jEdit ***
  3136 
  3137 * Improved Document panel: simplified interaction where every single
  3138 mouse click (re)opens document via desktop environment or as jEdit
  3139 buffer.
  3140 
  3141 * Support for Navigator plugin (with toolbar buttons), with connection
  3142 to PIDE hyperlinks.
  3143 
  3144 * Auxiliary files ('ML_file' etc.) are managed by the Prover IDE.
  3145 Open text buffers take precedence over copies within the file-system.
  3146 
  3147 * Improved support for Isabelle/ML, with jEdit mode "isabelle-ml" for
  3148 auxiliary ML files.
  3149 
  3150 * Improved syntactic and semantic completion mechanism, with simple
  3151 templates, completion language context, name-space completion,
  3152 file-name completion, spell-checker completion.
  3153 
  3154 * Refined GUI popup for completion: more robust key/mouse event
  3155 handling and propagation to enclosing text area -- avoid loosing
  3156 keystrokes with slow / remote graphics displays.
  3157 
  3158 * Completion popup supports both ENTER and TAB (default) to select an
  3159 item, depending on Isabelle options.
  3160 
  3161 * Refined insertion of completion items wrt. jEdit text: multiple
  3162 selections, rectangular selections, rectangular selection as "tall
  3163 caret".
  3164 
  3165 * Integrated spell-checker for document text, comments etc. with
  3166 completion popup and context-menu.
  3167 
  3168 * More general "Query" panel supersedes "Find" panel, with GUI access
  3169 to commands 'find_theorems' and 'find_consts', as well as print
  3170 operations for the context.  Minor incompatibility in keyboard
  3171 shortcuts etc.: replace action isabelle-find by isabelle-query.
  3172 
  3173 * Search field for all output panels ("Output", "Query", "Info" etc.)
  3174 to highlight text via regular expression.
  3175 
  3176 * Option "jedit_print_mode" (see also "Plugin Options / Isabelle /
  3177 General") allows to specify additional print modes for the prover
  3178 process, without requiring old-fashioned command-line invocation of
  3179 "isabelle jedit -m MODE".
  3180 
  3181 * More support for remote files (e.g. http) using standard Java
  3182 networking operations instead of jEdit virtual file-systems.
  3183 
  3184 * Empty editors buffers that are no longer required (e.g.\ via theory
  3185 imports) are automatically removed from the document model.
  3186 
  3187 * Improved monitor panel.
  3188 
  3189 * Improved Console/Scala plugin: more uniform scala.Console output,
  3190 more robust treatment of threads and interrupts.
  3191 
  3192 * Improved management of dockable windows: clarified keyboard focus
  3193 and window placement wrt. main editor view; optional menu item to
  3194 "Detach" a copy where this makes sense.
  3195 
  3196 * New Simplifier Trace panel provides an interactive view of the
  3197 simplification process, enabled by the "simp_trace_new" attribute
  3198 within the context.
  3199 
  3200 
  3201 *** Pure ***
  3202 
  3203 * Low-level type-class commands 'classes', 'classrel', 'arities' have
  3204 been discontinued to avoid the danger of non-trivial axiomatization
  3205 that is not immediately visible.  INCOMPATIBILITY, use regular
  3206 'instance' command with proof.  The required OFCLASS(...) theorem
  3207 might be postulated via 'axiomatization' beforehand, or the proof
  3208 finished trivially if the underlying class definition is made vacuous
  3209 (without any assumptions).  See also Isabelle/ML operations
  3210 Axclass.class_axiomatization, Axclass.classrel_axiomatization,
  3211 Axclass.arity_axiomatization.
  3212 
  3213 * Basic constants of Pure use more conventional names and are always
  3214 qualified.  Rare INCOMPATIBILITY, but with potentially serious
  3215 consequences, notably for tools in Isabelle/ML.  The following
  3216 renaming needs to be applied:
  3217 
  3218   ==             ~>  Pure.eq
  3219   ==>            ~>  Pure.imp
  3220   all            ~>  Pure.all
  3221   TYPE           ~>  Pure.type
  3222   dummy_pattern  ~>  Pure.dummy_pattern
  3223 
  3224 Systematic porting works by using the following theory setup on a
  3225 *previous* Isabelle version to introduce the new name accesses for the
  3226 old constants:
  3227 
  3228 setup {*
  3229   fn thy => thy
  3230     |> Sign.root_path
  3231     |> Sign.const_alias (Binding.qualify true "Pure" @{binding eq}) "=="
  3232     |> Sign.const_alias (Binding.qualify true "Pure" @{binding imp}) "==>"
  3233     |> Sign.const_alias (Binding.qualify true "Pure" @{binding all}) "all"
  3234     |> Sign.restore_naming thy
  3235 *}
  3236 
  3237 Thus ML antiquotations like @{const_name Pure.eq} may be used already.
  3238 Later the application is moved to the current Isabelle version, and
  3239 the auxiliary aliases are deleted.
  3240 
  3241 * Attributes "where" and "of" allow an optional context of local
  3242 variables ('for' declaration): these variables become schematic in the
  3243 instantiated theorem.
  3244 
  3245 * Obsolete attribute "standard" has been discontinued (legacy since
  3246 Isabelle2012).  Potential INCOMPATIBILITY, use explicit 'for' context
  3247 where instantiations with schematic variables are intended (for
  3248 declaration commands like 'lemmas' or attributes like "of").  The
  3249 following temporary definition may help to port old applications:
  3250 
  3251   attribute_setup standard =
  3252     "Scan.succeed (Thm.rule_attribute (K Drule.export_without_context))"
  3253 
  3254 * More thorough check of proof context for goal statements and
  3255 attributed fact expressions (concerning background theory, declared
  3256 hyps).  Potential INCOMPATIBILITY, tools need to observe standard
  3257 context discipline.  See also Assumption.add_assumes and the more
  3258 primitive Thm.assume_hyps.
  3259 
  3260 * Inner syntax token language allows regular quoted strings "..."
  3261 (only makes sense in practice, if outer syntax is delimited
  3262 differently, e.g. via cartouches).
  3263 
  3264 * Command 'print_term_bindings' supersedes 'print_binds' for clarity,
  3265 but the latter is retained some time as Proof General legacy.
  3266 
  3267 * Code generator preprocessor: explicit control of simp tracing on a
  3268 per-constant basis.  See attribute "code_preproc".
  3269 
  3270 
  3271 *** HOL ***
  3272 
  3273 * Code generator: enforce case of identifiers only for strict target
  3274 language requirements.  INCOMPATIBILITY.
  3275 
  3276 * Code generator: explicit proof contexts in many ML interfaces.
  3277 INCOMPATIBILITY.
  3278 
  3279 * Code generator: minimize exported identifiers by default.  Minor
  3280 INCOMPATIBILITY.
  3281 
  3282 * Code generation for SML and OCaml: dropped arcane "no_signatures"
  3283 option.  Minor INCOMPATIBILITY.
  3284 
  3285 * "declare [[code abort: ...]]" replaces "code_abort ...".
  3286 INCOMPATIBILITY.
  3287 
  3288 * "declare [[code drop: ...]]" drops all code equations associated
  3289 with the given constants.
  3290 
  3291 * Code generations are provided for make, fields, extend and truncate
  3292 operations on records.
  3293 
  3294 * Command and antiquotation "value" are now hardcoded against nbe and
  3295 ML.  Minor INCOMPATIBILITY.
  3296 
  3297 * Renamed command 'enriched_type' to 'functor'. INCOMPATIBILITY.
  3298 
  3299 * The symbol "\<newline>" may be used within char or string literals
  3300 to represent (Char Nibble0 NibbleA), i.e. ASCII newline.
  3301 
  3302 * Qualified String.implode and String.explode.  INCOMPATIBILITY.
  3303 
  3304 * Simplifier: Enhanced solver of preconditions of rewrite rules can
  3305 now deal with conjunctions.  For help with converting proofs, the old
  3306 behaviour of the simplifier can be restored like this: declare/using
  3307 [[simp_legacy_precond]].  This configuration option will disappear
  3308 again in the future.  INCOMPATIBILITY.
  3309 
  3310 * Simproc "finite_Collect" is no longer enabled by default, due to
  3311 spurious crashes and other surprises.  Potential INCOMPATIBILITY.
  3312 
  3313 * Moved new (co)datatype package and its dependencies from session
  3314   "HOL-BNF" to "HOL".  The commands 'bnf', 'wrap_free_constructors',
  3315   'datatype_new', 'codatatype', 'primcorec', 'primcorecursive' are now
  3316   part of theory "Main".
  3317 
  3318   Theory renamings:
  3319     FunDef.thy ~> Fun_Def.thy (and Fun_Def_Base.thy)
  3320     Library/Wfrec.thy ~> Wfrec.thy
  3321     Library/Zorn.thy ~> Zorn.thy
  3322     Cardinals/Order_Relation.thy ~> Order_Relation.thy
  3323     Library/Order_Union.thy ~> Cardinals/Order_Union.thy
  3324     Cardinals/Cardinal_Arithmetic_Base.thy ~> BNF_Cardinal_Arithmetic.thy
  3325     Cardinals/Cardinal_Order_Relation_Base.thy ~> BNF_Cardinal_Order_Relation.thy
  3326     Cardinals/Constructions_on_Wellorders_Base.thy ~> BNF_Constructions_on_Wellorders.thy
  3327     Cardinals/Wellorder_Embedding_Base.thy ~> BNF_Wellorder_Embedding.thy
  3328     Cardinals/Wellorder_Relation_Base.thy ~> BNF_Wellorder_Relation.thy
  3329     BNF/Ctr_Sugar.thy ~> Ctr_Sugar.thy
  3330     BNF/Basic_BNFs.thy ~> Basic_BNFs.thy
  3331     BNF/BNF_Comp.thy ~> BNF_Comp.thy
  3332     BNF/BNF_Def.thy ~> BNF_Def.thy
  3333     BNF/BNF_FP_Base.thy ~> BNF_FP_Base.thy
  3334     BNF/BNF_GFP.thy ~> BNF_GFP.thy
  3335     BNF/BNF_LFP.thy ~> BNF_LFP.thy
  3336     BNF/BNF_Util.thy ~> BNF_Util.thy
  3337     BNF/Coinduction.thy ~> Coinduction.thy
  3338     BNF/More_BNFs.thy ~> Library/More_BNFs.thy
  3339     BNF/Countable_Type.thy ~> Library/Countable_Set_Type.thy
  3340     BNF/Examples/* ~> BNF_Examples/*
  3341 
  3342   New theories:
  3343     Wellorder_Extension.thy (split from Zorn.thy)
  3344     Library/Cardinal_Notations.thy
  3345     Library/BNF_Axomatization.thy
  3346     BNF_Examples/Misc_Primcorec.thy
  3347     BNF_Examples/Stream_Processor.thy
  3348 
  3349   Discontinued theories:
  3350     BNF/BNF.thy
  3351     BNF/Equiv_Relations_More.thy
  3352 
  3353 INCOMPATIBILITY.
  3354 
  3355 * New (co)datatype package:
  3356   - Command 'primcorec' is fully implemented.
  3357   - Command 'datatype_new' generates size functions ("size_xxx" and
  3358     "size") as required by 'fun'.
  3359   - BNFs are integrated with the Lifting tool and new-style
  3360     (co)datatypes with Transfer.
  3361   - Renamed commands:
  3362       datatype_new_compat ~> datatype_compat
  3363       primrec_new ~> primrec
  3364       wrap_free_constructors ~> free_constructors
  3365     INCOMPATIBILITY.
  3366   - The generated constants "xxx_case" and "xxx_rec" have been renamed
  3367     "case_xxx" and "rec_xxx" (e.g., "prod_case" ~> "case_prod").
  3368     INCOMPATIBILITY.
  3369   - The constant "xxx_(un)fold" and related theorems are no longer
  3370     generated.  Use "xxx_(co)rec" or define "xxx_(un)fold" manually
  3371     using "prim(co)rec".
  3372     INCOMPATIBILITY.
  3373   - No discriminators are generated for nullary constructors by
  3374     default, eliminating the need for the odd "=:" syntax.
  3375     INCOMPATIBILITY.
  3376   - No discriminators or selectors are generated by default by
  3377     "datatype_new", unless custom names are specified or the new
  3378     "discs_sels" option is passed.
  3379     INCOMPATIBILITY.
  3380 
  3381 * Old datatype package:
  3382   - The generated theorems "xxx.cases" and "xxx.recs" have been
  3383     renamed "xxx.case" and "xxx.rec" (e.g., "sum.cases" ->
  3384     "sum.case").  INCOMPATIBILITY.
  3385   - The generated constants "xxx_case", "xxx_rec", and "xxx_size" have
  3386     been renamed "case_xxx", "rec_xxx", and "size_xxx" (e.g.,
  3387     "prod_case" ~> "case_prod").  INCOMPATIBILITY.
  3388 
  3389 * The types "'a list" and "'a option", their set and map functions,
  3390   their relators, and their selectors are now produced using the new
  3391   BNF-based datatype package.
  3392 
  3393   Renamed constants:
  3394     Option.set ~> set_option
  3395     Option.map ~> map_option
  3396     option_rel ~> rel_option
  3397 
  3398   Renamed theorems:
  3399     set_def ~> set_rec[abs_def]
  3400     map_def ~> map_rec[abs_def]
  3401     Option.map_def ~> map_option_case[abs_def] (with "case_option" instead of "rec_option")
  3402     option.recs ~> option.rec
  3403     list_all2_def ~> list_all2_iff
  3404     set.simps ~> set_simps (or the slightly different "list.set")
  3405     map.simps ~> list.map
  3406     hd.simps ~> list.sel(1)
  3407     tl.simps ~> list.sel(2-3)
  3408     the.simps ~> option.sel
  3409 
  3410 INCOMPATIBILITY.
  3411 
  3412 * The following map functions and relators have been renamed:
  3413     sum_map ~> map_sum
  3414     map_pair ~> map_prod
  3415     prod_rel ~> rel_prod
  3416     sum_rel ~> rel_sum
  3417     fun_rel ~> rel_fun
  3418     set_rel ~> rel_set
  3419     filter_rel ~> rel_filter
  3420     fset_rel ~> rel_fset (in "src/HOL/Library/FSet.thy")
  3421     cset_rel ~> rel_cset (in "src/HOL/Library/Countable_Set_Type.thy")
  3422     vset ~> rel_vset (in "src/HOL/Library/Quotient_Set.thy")
  3423 
  3424 INCOMPATIBILITY.
  3425 
  3426 * Lifting and Transfer:
  3427   - a type variable as a raw type is supported
  3428   - stronger reflexivity prover
  3429   - rep_eq is always generated by lift_definition
  3430   - setup for Lifting/Transfer is now automated for BNFs
  3431     + holds for BNFs that do not contain a dead variable
  3432     + relator_eq, relator_mono, relator_distr, relator_domain,
  3433       relator_eq_onp, quot_map, transfer rules for bi_unique, bi_total,
  3434       right_unique, right_total, left_unique, left_total are proved
  3435       automatically
  3436     + definition of a predicator is generated automatically
  3437     + simplification rules for a predicator definition are proved
  3438       automatically for datatypes
  3439   - consolidation of the setup of Lifting/Transfer
  3440     + property that a relator preservers reflexivity is not needed any
  3441       more
  3442       Minor INCOMPATIBILITY.
  3443     + left_total and left_unique rules are now transfer rules
  3444       (reflexivity_rule attribute not needed anymore)
  3445       INCOMPATIBILITY.
  3446     + Domainp does not have to be a separate assumption in
  3447       relator_domain theorems (=> more natural statement)
  3448       INCOMPATIBILITY.
  3449   - registration of code equations is more robust
  3450     Potential INCOMPATIBILITY.
  3451   - respectfulness proof obligation is preprocessed to a more readable
  3452     form
  3453     Potential INCOMPATIBILITY.
  3454   - eq_onp is always unfolded in respectfulness proof obligation
  3455     Potential INCOMPATIBILITY.
  3456   - unregister lifting setup for Code_Numeral.integer and
  3457     Code_Numeral.natural
  3458     Potential INCOMPATIBILITY.
  3459   - Lifting.invariant -> eq_onp
  3460     INCOMPATIBILITY.
  3461 
  3462 * New internal SAT solver "cdclite" that produces models and proof
  3463 traces.  This solver replaces the internal SAT solvers "enumerate" and
  3464 "dpll".  Applications that explicitly used one of these two SAT
  3465 solvers should use "cdclite" instead. In addition, "cdclite" is now
  3466 the default SAT solver for the "sat" and "satx" proof methods and
  3467 corresponding tactics; the old default can be restored using "declare
  3468 [[sat_solver = zchaff_with_proofs]]".  Minor INCOMPATIBILITY.
  3469 
  3470 * SMT module: A new version of the SMT module, temporarily called
  3471 "SMT2", uses SMT-LIB 2 and supports recent versions of Z3 (e.g.,
  3472 4.3). The new proof method is called "smt2". CVC3 and CVC4 are also
  3473 supported as oracles. Yices is no longer supported, because no version
  3474 of the solver can handle both SMT-LIB 2 and quantifiers.
  3475 
  3476 * Activation of Z3 now works via "z3_non_commercial" system option
  3477 (without requiring restart), instead of former settings variable
  3478 "Z3_NON_COMMERCIAL".  The option can be edited in Isabelle/jEdit menu
  3479 Plugin Options / Isabelle / General.
  3480 
  3481 * Sledgehammer:
  3482   - Z3 can now produce Isar proofs.
  3483   - MaSh overhaul:
  3484     . New SML-based learning algorithms eliminate the dependency on
  3485       Python and increase performance and reliability.
  3486     . MaSh and MeSh are now used by default together with the
  3487       traditional MePo (Meng-Paulson) relevance filter. To disable
  3488       MaSh, set the "MaSh" system option in Isabelle/jEdit Plugin
  3489       Options / Isabelle / General to "none".
  3490   - New option:
  3491       smt_proofs
  3492   - Renamed options:
  3493       isar_compress ~> compress
  3494       isar_try0 ~> try0
  3495 
  3496 INCOMPATIBILITY.
  3497 
  3498 * Removed solvers remote_cvc3 and remote_z3. Use cvc3 and z3 instead.
  3499 
  3500 * Nitpick:
  3501   - Fixed soundness bug whereby mutually recursive datatypes could
  3502     take infinite values.
  3503   - Fixed soundness bug with low-level number functions such as
  3504     "Abs_Integ" and "Rep_Integ".
  3505   - Removed "std" option.
  3506   - Renamed "show_datatypes" to "show_types" and "hide_datatypes" to
  3507     "hide_types".
  3508 
  3509 * Metis: Removed legacy proof method 'metisFT'. Use 'metis
  3510 (full_types)' instead. INCOMPATIBILITY.
  3511 
  3512 * Try0: Added 'algebra' and 'meson' to the set of proof methods.
  3513 
  3514 * Adjustion of INF and SUP operations:
  3515   - Elongated constants INFI and SUPR to INFIMUM and SUPREMUM.
  3516   - Consolidated theorem names containing INFI and SUPR: have INF and
  3517     SUP instead uniformly.
  3518   - More aggressive normalization of expressions involving INF and Inf
  3519     or SUP and Sup.
  3520   - INF_image and SUP_image do not unfold composition.
  3521   - Dropped facts INF_comp, SUP_comp.
  3522   - Default congruence rules strong_INF_cong and strong_SUP_cong, with
  3523     simplifier implication in premises.  Generalize and replace former
  3524     INT_cong, SUP_cong
  3525 
  3526 INCOMPATIBILITY.
  3527 
  3528 * SUP and INF generalized to conditionally_complete_lattice.
  3529 
  3530 * Swapped orientation of facts image_comp and vimage_comp:
  3531 
  3532   image_compose ~> image_comp [symmetric]
  3533   image_comp ~> image_comp [symmetric]
  3534   vimage_compose ~> vimage_comp [symmetric]
  3535   vimage_comp ~> vimage_comp [symmetric]
  3536 
  3537 INCOMPATIBILITY.
  3538 
  3539 * Theory reorganization: split of Big_Operators.thy into
  3540 Groups_Big.thy and Lattices_Big.thy.
  3541 
  3542 * Consolidated some facts about big group operators:
  3543 
  3544     setsum_0' ~> setsum.neutral
  3545     setsum_0 ~> setsum.neutral_const
  3546     setsum_addf ~> setsum.distrib
  3547     setsum_cartesian_product ~> setsum.cartesian_product
  3548     setsum_cases ~> setsum.If_cases
  3549     setsum_commute ~> setsum.commute
  3550     setsum_cong ~> setsum.cong
  3551     setsum_delta ~> setsum.delta
  3552     setsum_delta' ~> setsum.delta'
  3553     setsum_diff1' ~> setsum.remove
  3554     setsum_empty ~> setsum.empty
  3555     setsum_infinite ~> setsum.infinite
  3556     setsum_insert ~> setsum.insert
  3557     setsum_inter_restrict'' ~> setsum.inter_filter
  3558     setsum_mono_zero_cong_left ~> setsum.mono_neutral_cong_left
  3559     setsum_mono_zero_cong_right ~> setsum.mono_neutral_cong_right
  3560     setsum_mono_zero_left ~> setsum.mono_neutral_left
  3561     setsum_mono_zero_right ~> setsum.mono_neutral_right
  3562     setsum_reindex ~> setsum.reindex
  3563     setsum_reindex_cong ~> setsum.reindex_cong
  3564     setsum_reindex_nonzero ~> setsum.reindex_nontrivial
  3565     setsum_restrict_set ~> setsum.inter_restrict
  3566     setsum_Plus ~> setsum.Plus
  3567     setsum_setsum_restrict ~> setsum.commute_restrict
  3568     setsum_Sigma ~> setsum.Sigma
  3569     setsum_subset_diff ~> setsum.subset_diff
  3570     setsum_Un_disjoint ~> setsum.union_disjoint
  3571     setsum_UN_disjoint ~> setsum.UNION_disjoint
  3572     setsum_Un_Int ~> setsum.union_inter
  3573     setsum_Union_disjoint ~> setsum.Union_disjoint
  3574     setsum_UNION_zero ~> setsum.Union_comp
  3575     setsum_Un_zero ~> setsum.union_inter_neutral
  3576     strong_setprod_cong ~> setprod.strong_cong
  3577     strong_setsum_cong ~> setsum.strong_cong
  3578     setprod_1' ~> setprod.neutral
  3579     setprod_1 ~> setprod.neutral_const
  3580     setprod_cartesian_product ~> setprod.cartesian_product
  3581     setprod_cong ~> setprod.cong
  3582     setprod_delta ~> setprod.delta
  3583     setprod_delta' ~> setprod.delta'
  3584     setprod_empty ~> setprod.empty
  3585     setprod_infinite ~> setprod.infinite
  3586     setprod_insert ~> setprod.insert
  3587     setprod_mono_one_cong_left ~> setprod.mono_neutral_cong_left
  3588     setprod_mono_one_cong_right ~> setprod.mono_neutral_cong_right
  3589     setprod_mono_one_left ~> setprod.mono_neutral_left
  3590     setprod_mono_one_right ~> setprod.mono_neutral_right
  3591     setprod_reindex ~> setprod.reindex
  3592     setprod_reindex_cong ~> setprod.reindex_cong
  3593     setprod_reindex_nonzero ~> setprod.reindex_nontrivial
  3594     setprod_Sigma ~> setprod.Sigma
  3595     setprod_subset_diff ~> setprod.subset_diff
  3596     setprod_timesf ~> setprod.distrib
  3597     setprod_Un2 ~> setprod.union_diff2
  3598     setprod_Un_disjoint ~> setprod.union_disjoint
  3599     setprod_UN_disjoint ~> setprod.UNION_disjoint
  3600     setprod_Un_Int ~> setprod.union_inter
  3601     setprod_Union_disjoint ~> setprod.Union_disjoint
  3602     setprod_Un_one ~> setprod.union_inter_neutral
  3603 
  3604   Dropped setsum_cong2 (simple variant of setsum.cong).
  3605   Dropped setsum_inter_restrict' (simple variant of setsum.inter_restrict)
  3606   Dropped setsum_reindex_id, setprod_reindex_id
  3607     (simple variants of setsum.reindex [symmetric], setprod.reindex [symmetric]).
  3608 
  3609 INCOMPATIBILITY.
  3610 
  3611 * Abolished slightly odd global lattice interpretation for min/max.
  3612 
  3613   Fact consolidations:
  3614     min_max.inf_assoc ~> min.assoc
  3615     min_max.inf_commute ~> min.commute
  3616     min_max.inf_left_commute ~> min.left_commute
  3617     min_max.inf_idem ~> min.idem
  3618     min_max.inf_left_idem ~> min.left_idem
  3619     min_max.inf_right_idem ~> min.right_idem
  3620     min_max.sup_assoc ~> max.assoc
  3621     min_max.sup_commute ~> max.commute
  3622     min_max.sup_left_commute ~> max.left_commute
  3623     min_max.sup_idem ~> max.idem
  3624     min_max.sup_left_idem ~> max.left_idem
  3625     min_max.sup_inf_distrib1 ~> max_min_distrib2
  3626     min_max.sup_inf_distrib2 ~> max_min_distrib1
  3627     min_max.inf_sup_distrib1 ~> min_max_distrib2
  3628     min_max.inf_sup_distrib2 ~> min_max_distrib1
  3629     min_max.distrib ~> min_max_distribs
  3630     min_max.inf_absorb1 ~> min.absorb1
  3631     min_max.inf_absorb2 ~> min.absorb2
  3632     min_max.sup_absorb1 ~> max.absorb1
  3633     min_max.sup_absorb2 ~> max.absorb2
  3634     min_max.le_iff_inf ~> min.absorb_iff1
  3635     min_max.le_iff_sup ~> max.absorb_iff2
  3636     min_max.inf_le1 ~> min.cobounded1
  3637     min_max.inf_le2 ~> min.cobounded2
  3638     le_maxI1, min_max.sup_ge1 ~> max.cobounded1
  3639     le_maxI2, min_max.sup_ge2 ~> max.cobounded2
  3640     min_max.le_infI1 ~> min.coboundedI1
  3641     min_max.le_infI2 ~> min.coboundedI2
  3642     min_max.le_supI1 ~> max.coboundedI1
  3643     min_max.le_supI2 ~> max.coboundedI2
  3644     min_max.less_infI1 ~> min.strict_coboundedI1
  3645     min_max.less_infI2 ~> min.strict_coboundedI2
  3646     min_max.less_supI1 ~> max.strict_coboundedI1
  3647     min_max.less_supI2 ~> max.strict_coboundedI2
  3648     min_max.inf_mono ~> min.mono
  3649     min_max.sup_mono ~> max.mono
  3650     min_max.le_infI, min_max.inf_greatest ~> min.boundedI
  3651     min_max.le_supI, min_max.sup_least ~> max.boundedI
  3652     min_max.le_inf_iff ~> min.bounded_iff
  3653     min_max.le_sup_iff ~> max.bounded_iff
  3654 
  3655 For min_max.inf_sup_aci, prefer (one of) min.commute, min.assoc,
  3656 min.left_commute, min.left_idem, max.commute, max.assoc,
  3657 max.left_commute, max.left_idem directly.
  3658 
  3659 For min_max.inf_sup_ord, prefer (one of) min.cobounded1,
  3660 min.cobounded2, max.cobounded1m max.cobounded2 directly.
  3661 
  3662 For min_ac or max_ac, prefer more general collection ac_simps.
  3663 
  3664 INCOMPATIBILITY.
  3665 
  3666 * Theorem disambiguation Inf_le_Sup (on finite sets) ~>
  3667 Inf_fin_le_Sup_fin.  INCOMPATIBILITY.
  3668 
  3669 * Qualified constant names Wellfounded.acc, Wellfounded.accp.
  3670 INCOMPATIBILITY.
  3671 
  3672 * Fact generalization and consolidation:
  3673     neq_one_mod_two, mod_2_not_eq_zero_eq_one_int ~> not_mod_2_eq_0_eq_1
  3674 
  3675 INCOMPATIBILITY.
  3676 
  3677 * Purely algebraic definition of even.  Fact generalization and
  3678   consolidation:
  3679     nat_even_iff_2_dvd, int_even_iff_2_dvd ~> even_iff_2_dvd
  3680     even_zero_(nat|int) ~> even_zero
  3681 
  3682 INCOMPATIBILITY.
  3683 
  3684 * Abolished neg_numeral.
  3685   - Canonical representation for minus one is "- 1".
  3686   - Canonical representation for other negative numbers is "- (numeral _)".
  3687   - When devising rule sets for number calculation, consider the
  3688     following canonical cases: 0, 1, numeral _, - 1, - numeral _.
  3689   - HOLogic.dest_number also recognizes numerals in non-canonical forms
  3690     like "numeral One", "- numeral One", "- 0" and even "- ... - _".
  3691   - Syntax for negative numerals is mere input syntax.
  3692 
  3693 INCOMPATIBILITY.
  3694 
  3695 * Reduced name variants for rules on associativity and commutativity:
  3696 
  3697     add_assoc ~> add.assoc
  3698     add_commute ~> add.commute
  3699     add_left_commute ~> add.left_commute
  3700     mult_assoc ~> mult.assoc
  3701     mult_commute ~> mult.commute
  3702     mult_left_commute ~> mult.left_commute
  3703     nat_add_assoc ~> add.assoc
  3704     nat_add_commute ~> add.commute
  3705     nat_add_left_commute ~> add.left_commute
  3706     nat_mult_assoc ~> mult.assoc
  3707     nat_mult_commute ~> mult.commute
  3708     eq_assoc ~> iff_assoc
  3709     eq_left_commute ~> iff_left_commute
  3710 
  3711 INCOMPATIBILITY.
  3712 
  3713 * Fact collections add_ac and mult_ac are considered old-fashioned.
  3714 Prefer ac_simps instead, or specify rules
  3715 (add|mult).(assoc|commute|left_commute) individually.
  3716 
  3717 * Elimination of fact duplicates:
  3718     equals_zero_I ~> minus_unique
  3719     diff_eq_0_iff_eq ~> right_minus_eq
  3720     nat_infinite ~> infinite_UNIV_nat
  3721     int_infinite ~> infinite_UNIV_int
  3722 
  3723 INCOMPATIBILITY.
  3724 
  3725 * Fact name consolidation:
  3726     diff_def, diff_minus, ab_diff_minus ~> diff_conv_add_uminus
  3727     minus_le_self_iff ~> neg_less_eq_nonneg
  3728     le_minus_self_iff ~> less_eq_neg_nonpos
  3729     neg_less_nonneg ~> neg_less_pos
  3730     less_minus_self_iff ~> less_neg_neg [simp]
  3731 
  3732 INCOMPATIBILITY.
  3733 
  3734 * More simplification rules on unary and binary minus:
  3735 add_diff_cancel, add_diff_cancel_left, add_le_same_cancel1,
  3736 add_le_same_cancel2, add_less_same_cancel1, add_less_same_cancel2,
  3737 add_minus_cancel, diff_add_cancel, le_add_same_cancel1,
  3738 le_add_same_cancel2, less_add_same_cancel1, less_add_same_cancel2,
  3739 minus_add_cancel, uminus_add_conv_diff.  These correspondingly have
  3740 been taken away from fact collections algebra_simps and field_simps.
  3741 INCOMPATIBILITY.
  3742 
  3743 To restore proofs, the following patterns are helpful:
  3744 
  3745 a) Arbitrary failing proof not involving "diff_def":
  3746 Consider simplification with algebra_simps or field_simps.
  3747 
  3748 b) Lifting rules from addition to subtraction:
  3749 Try with "using <rule for addition> of [... "- _" ...]" by simp".
  3750 
  3751 c) Simplification with "diff_def": just drop "diff_def".
  3752 Consider simplification with algebra_simps or field_simps;
  3753 or the brute way with
  3754 "simp add: diff_conv_add_uminus del: add_uminus_conv_diff".
  3755 
  3756 * Introduce bdd_above and bdd_below in theory
  3757 Conditionally_Complete_Lattices, use them instead of explicitly
  3758 stating boundedness of sets.
  3759 
  3760 * ccpo.admissible quantifies only over non-empty chains to allow more
  3761 syntax-directed proof rules; the case of the empty chain shows up as
  3762 additional case in fixpoint induction proofs.  INCOMPATIBILITY.
  3763 
  3764 * Removed and renamed theorems in Series:
  3765   summable_le         ~>  suminf_le
  3766   suminf_le           ~>  suminf_le_const
  3767   series_pos_le       ~>  setsum_le_suminf
  3768   series_pos_less     ~>  setsum_less_suminf
  3769   suminf_ge_zero      ~>  suminf_nonneg
  3770   suminf_gt_zero      ~>  suminf_pos
  3771   suminf_gt_zero_iff  ~>  suminf_pos_iff
  3772   summable_sumr_LIMSEQ_suminf  ~>  summable_LIMSEQ
  3773   suminf_0_le         ~>  suminf_nonneg [rotate]
  3774   pos_summable        ~>  summableI_nonneg_bounded
  3775   ratio_test          ~>  summable_ratio_test
  3776 
  3777   removed series_zero, replaced by sums_finite
  3778 
  3779   removed auxiliary lemmas:
  3780 
  3781     sumr_offset, sumr_offset2, sumr_offset3, sumr_offset4, sumr_group,
  3782     half, le_Suc_ex_iff, lemma_realpow_diff_sumr,
  3783     real_setsum_nat_ivl_bounded, summable_le2, ratio_test_lemma2,
  3784     sumr_minus_one_realpow_zerom, sumr_one_lb_realpow_zero,
  3785     summable_convergent_sumr_iff, sumr_diff_mult_const
  3786 
  3787 INCOMPATIBILITY.
  3788 
  3789 * Replace (F)DERIV syntax by has_derivative:
  3790   - "(f has_derivative f') (at x within s)" replaces "FDERIV f x : s : f'"
  3791 
  3792   - "(f has_field_derivative f') (at x within s)" replaces "DERIV f x : s : f'"
  3793 
  3794   - "f differentiable at x within s" replaces "_ differentiable _ in _" syntax
  3795 
  3796   - removed constant isDiff
  3797 
  3798   - "DERIV f x : f'" and "FDERIV f x : f'" syntax is only available as
  3799     input syntax.
  3800 
  3801   - "DERIV f x : s : f'" and "FDERIV f x : s : f'" syntax removed.
  3802 
  3803   - Renamed FDERIV_... lemmas to has_derivative_...
  3804 
  3805   - renamed deriv (the syntax constant used for "DERIV _ _ :> _") to DERIV
  3806 
  3807   - removed DERIV_intros, has_derivative_eq_intros
  3808 
  3809   - introduced derivative_intros and deriative_eq_intros which
  3810     includes now rules for DERIV, has_derivative and
  3811     has_vector_derivative.
  3812 
  3813   - Other renamings:
  3814     differentiable_def        ~>  real_differentiable_def
  3815     differentiableE           ~>  real_differentiableE
  3816     fderiv_def                ~>  has_derivative_at
  3817     field_fderiv_def          ~>  field_has_derivative_at
  3818     isDiff_der                ~>  differentiable_def
  3819     deriv_fderiv              ~>  has_field_derivative_def
  3820     deriv_def                 ~>  DERIV_def
  3821 
  3822 INCOMPATIBILITY.
  3823 
  3824 * Include more theorems in continuous_intros. Remove the
  3825 continuous_on_intros, isCont_intros collections, these facts are now
  3826 in continuous_intros.
  3827 
  3828 * Theorems about complex numbers are now stated only using Re and Im,
  3829 the Complex constructor is not used anymore. It is possible to use
  3830 primcorec to defined the behaviour of a complex-valued function.
  3831 
  3832 Removed theorems about the Complex constructor from the simpset, they
  3833 are available as the lemma collection legacy_Complex_simps. This
  3834 especially removes
  3835 
  3836     i_complex_of_real: "ii * complex_of_real r = Complex 0 r".
  3837 
  3838 Instead the reverse direction is supported with
  3839     Complex_eq: "Complex a b = a + \<i> * b"
  3840 
  3841 Moved csqrt from Fundamental_Algebra_Theorem to Complex.
  3842 
  3843   Renamings:
  3844     Re/Im                  ~>  complex.sel
  3845     complex_Re/Im_zero     ~>  zero_complex.sel
  3846     complex_Re/Im_add      ~>  plus_complex.sel
  3847     complex_Re/Im_minus    ~>  uminus_complex.sel
  3848     complex_Re/Im_diff     ~>  minus_complex.sel
  3849     complex_Re/Im_one      ~>  one_complex.sel
  3850     complex_Re/Im_mult     ~>  times_complex.sel
  3851     complex_Re/Im_inverse  ~>  inverse_complex.sel
  3852     complex_Re/Im_scaleR   ~>  scaleR_complex.sel
  3853     complex_Re/Im_i        ~>  ii.sel
  3854     complex_Re/Im_cnj      ~>  cnj.sel
  3855     Re/Im_cis              ~>  cis.sel
  3856 
  3857     complex_divide_def   ~>  divide_complex_def
  3858     complex_norm_def     ~>  norm_complex_def
  3859     cmod_def             ~>  norm_complex_de
  3860 
  3861   Removed theorems:
  3862     complex_zero_def
  3863     complex_add_def
  3864     complex_minus_def
  3865     complex_diff_def
  3866     complex_one_def
  3867     complex_mult_def
  3868     complex_inverse_def
  3869     complex_scaleR_def
  3870 
  3871 INCOMPATIBILITY.
  3872 
  3873 * Theory Lubs moved HOL image to HOL-Library. It is replaced by
  3874 Conditionally_Complete_Lattices.  INCOMPATIBILITY.
  3875 
  3876 * HOL-Library: new theory src/HOL/Library/Tree.thy.
  3877 
  3878 * HOL-Library: removed theory src/HOL/Library/Kleene_Algebra.thy; it
  3879 is subsumed by session Kleene_Algebra in AFP.
  3880 
  3881 * HOL-Library / theory RBT: various constants and facts are hidden;
  3882 lifting setup is unregistered.  INCOMPATIBILITY.
  3883 
  3884 * HOL-Cardinals: new theory src/HOL/Cardinals/Ordinal_Arithmetic.thy.
  3885 
  3886 * HOL-Word: bit representations prefer type bool over type bit.
  3887 INCOMPATIBILITY.
  3888 
  3889 * HOL-Word:
  3890   - Abandoned fact collection "word_arith_alts", which is a duplicate
  3891     of "word_arith_wis".
  3892   - Dropped first (duplicated) element in fact collections
  3893     "sint_word_ariths", "word_arith_alts", "uint_word_ariths",
  3894     "uint_word_arith_bintrs".
  3895 
  3896 * HOL-Number_Theory:
  3897   - consolidated the proofs of the binomial theorem
  3898   - the function fib is again of type nat => nat and not overloaded
  3899   - no more references to Old_Number_Theory in the HOL libraries
  3900     (except the AFP)
  3901 
  3902 INCOMPATIBILITY.
  3903 
  3904 * HOL-Multivariate_Analysis:
  3905   - Type class ordered_real_vector for ordered vector spaces.
  3906   - New theory Complex_Basic_Analysis defining complex derivatives,
  3907     holomorphic functions, etc., ported from HOL Light's canal.ml.
  3908   - Changed order of ordered_euclidean_space to be compatible with
  3909     pointwise ordering on products. Therefore instance of
  3910     conditionally_complete_lattice and ordered_real_vector.
  3911     INCOMPATIBILITY: use box instead of greaterThanLessThan or
  3912     explicit set-comprehensions with eucl_less for other (half-)open
  3913     intervals.
  3914   - removed dependencies on type class ordered_euclidean_space with
  3915     introduction of "cbox" on euclidean_space
  3916     - renamed theorems:
  3917         interval ~> box
  3918         mem_interval ~> mem_box
  3919         interval_eq_empty ~> box_eq_empty
  3920         interval_ne_empty ~> box_ne_empty
  3921         interval_sing(1) ~> cbox_sing
  3922         interval_sing(2) ~> box_sing
  3923         subset_interval_imp ~> subset_box_imp
  3924         subset_interval ~> subset_box
  3925         open_interval ~> open_box
  3926         closed_interval ~> closed_cbox
  3927         interior_closed_interval ~> interior_cbox
  3928         bounded_closed_interval ~> bounded_cbox
  3929         compact_interval ~> compact_cbox
  3930         bounded_subset_closed_interval_symmetric ~> bounded_subset_cbox_symmetric
  3931         bounded_subset_closed_interval ~> bounded_subset_cbox
  3932         mem_interval_componentwiseI ~> mem_box_componentwiseI
  3933         convex_box ~> convex_prod
  3934         rel_interior_real_interval ~> rel_interior_real_box
  3935         convex_interval ~> convex_box
  3936         convex_hull_eq_real_interval ~> convex_hull_eq_real_cbox
  3937         frechet_derivative_within_closed_interval ~> frechet_derivative_within_cbox
  3938         content_closed_interval' ~> content_cbox'
  3939         elementary_subset_interval ~> elementary_subset_box
  3940         diameter_closed_interval ~> diameter_cbox
  3941         frontier_closed_interval ~> frontier_cbox
  3942         frontier_open_interval ~> frontier_box
  3943         bounded_subset_open_interval_symmetric ~> bounded_subset_box_symmetric
  3944         closure_open_interval ~> closure_box
  3945         open_closed_interval_convex ~> open_cbox_convex
  3946         open_interval_midpoint ~> box_midpoint
  3947         content_image_affinity_interval ~> content_image_affinity_cbox
  3948         is_interval_interval ~> is_interval_cbox + is_interval_box + is_interval_closed_interval
  3949         bounded_interval ~> bounded_closed_interval + bounded_boxes
  3950 
  3951     - respective theorems for intervals over the reals:
  3952         content_closed_interval + content_cbox
  3953         has_integral + has_integral_real
  3954         fine_division_exists + fine_division_exists_real
  3955         has_integral_null + has_integral_null_real
  3956         tagged_division_union_interval + tagged_division_union_interval_real
  3957         has_integral_const + has_integral_const_real
  3958         integral_const + integral_const_real
  3959         has_integral_bound + has_integral_bound_real
  3960         integrable_continuous + integrable_continuous_real
  3961         integrable_subinterval + integrable_subinterval_real
  3962         has_integral_reflect_lemma + has_integral_reflect_lemma_real
  3963         integrable_reflect + integrable_reflect_real
  3964         integral_reflect + integral_reflect_real
  3965         image_affinity_interval + image_affinity_cbox
  3966         image_smult_interval + image_smult_cbox
  3967         integrable_const + integrable_const_ivl
  3968         integrable_on_subinterval + integrable_on_subcbox
  3969 
  3970   - renamed theorems:
  3971     derivative_linear         ~>  has_derivative_bounded_linear
  3972     derivative_is_linear      ~>  has_derivative_linear
  3973     bounded_linear_imp_linear ~>  bounded_linear.linear
  3974 
  3975 * HOL-Probability:
  3976   - Renamed positive_integral to nn_integral:
  3977 
  3978     . Renamed all lemmas "*positive_integral*" to *nn_integral*"
  3979       positive_integral_positive ~> nn_integral_nonneg
  3980 
  3981     . Renamed abbreviation integral\<^sup>P to integral\<^sup>N.
  3982 
  3983   - replaced the Lebesgue integral on real numbers by the more general
  3984     Bochner integral for functions into a real-normed vector space.
  3985 
  3986     integral_zero               ~>  integral_zero / integrable_zero
  3987     integral_minus              ~>  integral_minus / integrable_minus
  3988     integral_add                ~>  integral_add / integrable_add
  3989     integral_diff               ~>  integral_diff / integrable_diff
  3990     integral_setsum             ~>  integral_setsum / integrable_setsum
  3991     integral_multc              ~>  integral_mult_left / integrable_mult_left
  3992     integral_cmult              ~>  integral_mult_right / integrable_mult_right
  3993     integral_triangle_inequality~>  integral_norm_bound
  3994     integrable_nonneg           ~>  integrableI_nonneg
  3995     integral_positive           ~>  integral_nonneg_AE
  3996     integrable_abs_iff          ~>  integrable_abs_cancel
  3997     positive_integral_lim_INF   ~>  nn_integral_liminf
  3998     lebesgue_real_affine        ~>  lborel_real_affine
  3999     borel_integral_has_integral ~>  has_integral_lebesgue_integral
  4000     integral_indicator          ~>
  4001          integral_real_indicator / integrable_real_indicator
  4002     positive_integral_fst       ~>  nn_integral_fst'
  4003     positive_integral_fst_measurable ~> nn_integral_fst
  4004     positive_integral_snd_measurable ~> nn_integral_snd
  4005 
  4006     integrable_fst_measurable   ~>
  4007          integral_fst / integrable_fst / AE_integrable_fst
  4008 
  4009     integrable_snd_measurable   ~>
  4010          integral_snd / integrable_snd / AE_integrable_snd
  4011 
  4012     integral_monotone_convergence  ~>
  4013          integral_monotone_convergence / integrable_monotone_convergence
  4014 
  4015     integral_monotone_convergence_at_top  ~>
  4016          integral_monotone_convergence_at_top /
  4017          integrable_monotone_convergence_at_top
  4018 
  4019     has_integral_iff_positive_integral_lebesgue  ~>
  4020          has_integral_iff_has_bochner_integral_lebesgue_nonneg
  4021 
  4022     lebesgue_integral_has_integral  ~>
  4023          has_integral_integrable_lebesgue_nonneg
  4024 
  4025     positive_integral_lebesgue_has_integral  ~>
  4026          integral_has_integral_lebesgue_nonneg /
  4027          integrable_has_integral_lebesgue_nonneg
  4028 
  4029     lebesgue_integral_real_affine  ~>
  4030          nn_integral_real_affine
  4031 
  4032     has_integral_iff_positive_integral_lborel  ~>
  4033          integral_has_integral_nonneg / integrable_has_integral_nonneg
  4034 
  4035     The following theorems where removed:
  4036 
  4037     lebesgue_integral_nonneg
  4038     lebesgue_integral_uminus
  4039     lebesgue_integral_cmult
  4040     lebesgue_integral_multc
  4041     lebesgue_integral_cmult_nonneg
  4042     integral_cmul_indicator
  4043     integral_real
  4044 
  4045   - Formalized properties about exponentially, Erlang, and normal
  4046     distributed random variables.
  4047 
  4048 * HOL-Decision_Procs: Separate command 'approximate' for approximative
  4049 computation in src/HOL/Decision_Procs/Approximation.  Minor
  4050 INCOMPATIBILITY.
  4051 
  4052 
  4053 *** Scala ***
  4054 
  4055 * The signature and semantics of Document.Snapshot.cumulate_markup /
  4056 select_markup have been clarified.  Markup is now traversed in the
  4057 order of reports given by the prover: later markup is usually more
  4058 specific and may override results accumulated so far.  The elements
  4059 guard is mandatory and checked precisely.  Subtle INCOMPATIBILITY.
  4060 
  4061 * Substantial reworking of internal PIDE protocol communication
  4062 channels.  INCOMPATIBILITY.
  4063 
  4064 
  4065 *** ML ***
  4066 
  4067 * Subtle change of semantics of Thm.eq_thm: theory stamps are not
  4068 compared (according to Thm.thm_ord), but assumed to be covered by the
  4069 current background theory.  Thus equivalent data produced in different
  4070 branches of the theory graph usually coincides (e.g. relevant for
  4071 theory merge).  Note that the softer Thm.eq_thm_prop is often more
  4072 appropriate than Thm.eq_thm.
  4073 
  4074 * Proper context for basic Simplifier operations: rewrite_rule,
  4075 rewrite_goals_rule, rewrite_goals_tac etc. INCOMPATIBILITY, need to
  4076 pass runtime Proof.context (and ensure that the simplified entity
  4077 actually belongs to it).
  4078 
  4079 * Proper context discipline for read_instantiate and instantiate_tac:
  4080 variables that are meant to become schematic need to be given as
  4081 fixed, and are generalized by the explicit context of local variables.
  4082 This corresponds to Isar attributes "where" and "of" with 'for'
  4083 declaration.  INCOMPATIBILITY, also due to potential change of indices
  4084 of schematic variables.
  4085 
  4086 * Moved ML_Compiler.exn_trace and other operations on exceptions to
  4087 structure Runtime.  Minor INCOMPATIBILITY.
  4088 
  4089 * Discontinued old Toplevel.debug in favour of system option
  4090 "ML_exception_trace", which may be also declared within the context
  4091 via "declare [[ML_exception_trace = true]]".  Minor INCOMPATIBILITY.
  4092 
  4093 * Renamed configuration option "ML_trace" to "ML_source_trace". Minor
  4094 INCOMPATIBILITY.
  4095 
  4096 * Configuration option "ML_print_depth" controls the pretty-printing
  4097 depth of the ML compiler within the context.  The old print_depth in
  4098 ML is still available as default_print_depth, but rarely used.  Minor
  4099 INCOMPATIBILITY.
  4100 
  4101 * Toplevel function "use" refers to raw ML bootstrap environment,
  4102 without Isar context nor antiquotations.  Potential INCOMPATIBILITY.
  4103 Note that 'ML_file' is the canonical command to load ML files into the
  4104 formal context.
  4105 
  4106 * Simplified programming interface to define ML antiquotations, see
  4107 structure ML_Antiquotation.  Minor INCOMPATIBILITY.
  4108 
  4109 * ML antiquotation @{here} refers to its source position, which is
  4110 occasionally useful for experimentation and diagnostic purposes.
  4111 
  4112 * ML antiquotation @{path} produces a Path.T value, similarly to
  4113 Path.explode, but with compile-time check against the file-system and
  4114 some PIDE markup.  Note that unlike theory source, ML does not have a
  4115 well-defined master directory, so an absolute symbolic path
  4116 specification is usually required, e.g. "~~/src/HOL".
  4117 
  4118 * ML antiquotation @{print} inlines a function to print an arbitrary
  4119 ML value, which is occasionally useful for diagnostic or demonstration
  4120 purposes.
  4121 
  4122 
  4123 *** System ***
  4124 
  4125 * Proof General with its traditional helper scripts is now an optional
  4126 Isabelle component, e.g. see ProofGeneral-4.2-2 from the Isabelle
  4127 component repository http://isabelle.in.tum.de/components/.  Note that
  4128 the "system" manual provides general explanations about add-on
  4129 components, especially those that are not bundled with the release.
  4130 
  4131 * The raw Isabelle process executable has been renamed from
  4132 "isabelle-process" to "isabelle_process", which conforms to common
  4133 shell naming conventions, and allows to define a shell function within
  4134 the Isabelle environment to avoid dynamic path lookup.  Rare
  4135 incompatibility for old tools that do not use the ISABELLE_PROCESS
  4136 settings variable.
  4137 
  4138 * Former "isabelle tty" has been superseded by "isabelle console",
  4139 with implicit build like "isabelle jedit", and without the mostly
  4140 obsolete Isar TTY loop.
  4141 
  4142 * Simplified "isabelle display" tool.  Settings variables DVI_VIEWER
  4143 and PDF_VIEWER now refer to the actual programs, not shell
  4144 command-lines.  Discontinued option -c: invocation may be asynchronous
  4145 via desktop environment, without any special precautions.  Potential
  4146 INCOMPATIBILITY with ambitious private settings.
  4147 
  4148 * Removed obsolete "isabelle unsymbolize".  Note that the usual format
  4149 for email communication is the Unicode rendering of Isabelle symbols,
  4150 as produced by Isabelle/jEdit, for example.
  4151 
  4152 * Removed obsolete tool "wwwfind". Similar functionality may be
  4153 integrated into Isabelle/jEdit eventually.
  4154 
  4155 * Improved 'display_drafts' concerning desktop integration and
  4156 repeated invocation in PIDE front-end: re-use single file
  4157 $ISABELLE_HOME_USER/tmp/drafts.pdf and corresponding views.
  4158 
  4159 * Session ROOT specifications require explicit 'document_files' for
  4160 robust dependencies on LaTeX sources.  Only these explicitly given
  4161 files are copied to the document output directory, before document
  4162 processing is started.
  4163 
  4164 * Windows: support for regular TeX installation (e.g. MiKTeX) instead
  4165 of TeX Live from Cygwin.
  4166 
  4167 
  4168 
  4169 New in Isabelle2013-2 (December 2013)
  4170 -------------------------------------
  4171 
  4172 *** Prover IDE -- Isabelle/Scala/jEdit ***
  4173 
  4174 * More robust editing of running commands with internal forks,
  4175 e.g. non-terminating 'by' steps.
  4176 
  4177 * More relaxed Sledgehammer panel: avoid repeated application of query
  4178 after edits surrounding the command location.
  4179 
  4180 * More status information about commands that are interrupted
  4181 accidentally (via physical event or Poly/ML runtime system signal,
  4182 e.g. out-of-memory).
  4183 
  4184 
  4185 *** System ***
  4186 
  4187 * More robust termination of external processes managed by
  4188 Isabelle/ML: support cancellation of tasks within the range of
  4189 milliseconds, as required for PIDE document editing with automatically
  4190 tried tools (e.g. Sledgehammer).
  4191 
  4192 * Reactivated Isabelle/Scala kill command for external processes on
  4193 Mac OS X, which was accidentally broken in Isabelle2013-1 due to a
  4194 workaround for some Debian/Ubuntu Linux versions from 2013.
  4195 
  4196 
  4197 
  4198 New in Isabelle2013-1 (November 2013)
  4199 -------------------------------------
  4200 
  4201 *** General ***
  4202 
  4203 * Discontinued obsolete 'uses' within theory header.  Note that
  4204 commands like 'ML_file' work without separate declaration of file
  4205 dependencies.  Minor INCOMPATIBILITY.
  4206 
  4207 * Discontinued redundant 'use' command, which was superseded by
  4208 'ML_file' in Isabelle2013.  Minor INCOMPATIBILITY.
  4209 
  4210 * Simplified subscripts within identifiers, using plain \<^sub>
  4211 instead of the second copy \<^isub> and \<^isup>.  Superscripts are
  4212 only for literal tokens within notation; explicit mixfix annotations
  4213 for consts or fixed variables may be used as fall-back for unusual
  4214 names.  Obsolete \<twosuperior> has been expanded to \<^sup>2 in
  4215 Isabelle/HOL.  INCOMPATIBILITY, use "isabelle update_sub_sup" to
  4216 standardize symbols as a starting point for further manual cleanup.
  4217 The ML reference variable "legacy_isub_isup" may be set as temporary
  4218 workaround, to make the prover accept a subset of the old identifier
  4219 syntax.
  4220 
  4221 * Document antiquotations: term style "isub" has been renamed to
  4222 "sub".  Minor INCOMPATIBILITY.
  4223 
  4224 * Uniform management of "quick_and_dirty" as system option (see also
  4225 "isabelle options"), configuration option within the context (see also
  4226 Config.get in Isabelle/ML), and attribute in Isabelle/Isar.  Minor
  4227 INCOMPATIBILITY, need to use more official Isabelle means to access
  4228 quick_and_dirty, instead of historical poking into mutable reference.
  4229 
  4230 * Renamed command 'print_configs' to 'print_options'.  Minor
  4231 INCOMPATIBILITY.
  4232 
  4233 * Proper diagnostic command 'print_state'.  Old 'pr' (with its
  4234 implicit change of some global references) is retained for now as
  4235 control command, e.g. for ProofGeneral 3.7.x.
  4236 
  4237 * Discontinued 'print_drafts' command with its old-fashioned PS output
  4238 and Unix command-line print spooling.  Minor INCOMPATIBILITY: use
  4239 'display_drafts' instead and print via the regular document viewer.
  4240 
  4241 * Updated and extended "isar-ref" and "implementation" manual,
  4242 eliminated old "ref" manual.
  4243 
  4244 
  4245 *** Prover IDE -- Isabelle/Scala/jEdit ***
  4246 
  4247 * New manual "jedit" for Isabelle/jEdit, see isabelle doc or
  4248 Documentation panel.
  4249 
  4250 * Dockable window "Documentation" provides access to Isabelle
  4251 documentation.
  4252 
  4253 * Dockable window "Find" provides query operations for formal entities
  4254 (GUI front-end to 'find_theorems' command).
  4255 
  4256 * Dockable window "Sledgehammer" manages asynchronous / parallel
  4257 sledgehammer runs over existing document sources, independently of
  4258 normal editing and checking process.
  4259 
  4260 * Dockable window "Timing" provides an overview of relevant command
  4261 timing information, depending on option jedit_timing_threshold.  The
  4262 same timing information is shown in the extended tooltip of the
  4263 command keyword, when hovering the mouse over it while the CONTROL or
  4264 COMMAND modifier is pressed.
  4265 
  4266 * Improved dockable window "Theories": Continuous checking of proof
  4267 document (visible and required parts) may be controlled explicitly,
  4268 using check box or shortcut "C+e ENTER".  Individual theory nodes may
  4269 be marked explicitly as required and checked in full, using check box
  4270 or shortcut "C+e SPACE".
  4271 
  4272 * Improved completion mechanism, which is now managed by the
  4273 Isabelle/jEdit plugin instead of SideKick.  Refined table of Isabelle
  4274 symbol abbreviations (see $ISABELLE_HOME/etc/symbols).
  4275 
  4276 * Standard jEdit keyboard shortcut C+b complete-word is remapped to
  4277 isabelle.complete for explicit completion in Isabelle sources.
  4278 INCOMPATIBILITY wrt. jEdit defaults, may have to invent new shortcuts
  4279 to resolve conflict.
  4280 
  4281 * Improved support of various "minor modes" for Isabelle NEWS,
  4282 options, session ROOT etc., with completion and SideKick tree view.
  4283 
  4284 * Strictly monotonic document update, without premature cancellation of
  4285 running transactions that are still needed: avoid reset/restart of
  4286 such command executions while editing.
  4287 
  4288 * Support for asynchronous print functions, as overlay to existing
  4289 document content.
  4290 
  4291 * Support for automatic tools in HOL, which try to prove or disprove
  4292 toplevel theorem statements.
  4293 
  4294 * Action isabelle.reset-font-size resets main text area font size
  4295 according to Isabelle/Scala plugin option "jedit_font_reset_size" (see
  4296 also "Plugin Options / Isabelle / General").  It can be bound to some
  4297 keyboard shortcut by the user (e.g. C+0 and/or C+NUMPAD0).
  4298 
  4299 * File specifications in jEdit (e.g. file browser) may refer to
  4300 $ISABELLE_HOME and $ISABELLE_HOME_USER on all platforms.  Discontinued
  4301 obsolete $ISABELLE_HOME_WINDOWS variable.
  4302 
  4303 * Improved support for Linux look-and-feel "GTK+", see also "Utilities
  4304 / Global Options / Appearance".
  4305 
  4306 * Improved support of native Mac OS X functionality via "MacOSX"
  4307 plugin, which is now enabled by default.
  4308 
  4309 
  4310 *** Pure ***
  4311 
  4312 * Commands 'interpretation' and 'sublocale' are now target-sensitive.
  4313 In particular, 'interpretation' allows for non-persistent
  4314 interpretation within "context ... begin ... end" blocks offering a
  4315 light-weight alternative to 'sublocale'.  See "isar-ref" manual for
  4316 details.
  4317 
  4318 * Improved locales diagnostic command 'print_dependencies'.
  4319 
  4320 * Discontinued obsolete 'axioms' command, which has been marked as
  4321 legacy since Isabelle2009-2.  INCOMPATIBILITY, use 'axiomatization'
  4322 instead, while observing its uniform scope for polymorphism.
  4323 
  4324 * Discontinued empty name bindings in 'axiomatization'.
  4325 INCOMPATIBILITY.
  4326 
  4327 * System option "proofs" has been discontinued.  Instead the global
  4328 state of Proofterm.proofs is persistently compiled into logic images
  4329 as required, notably HOL-Proofs.  Users no longer need to change
  4330 Proofterm.proofs dynamically.  Minor INCOMPATIBILITY.
  4331 
  4332 * Syntax translation functions (print_translation etc.) always depend
  4333 on Proof.context.  Discontinued former "(advanced)" option -- this is
  4334 now the default.  Minor INCOMPATIBILITY.
  4335 
  4336 * Former global reference trace_unify_fail is now available as
  4337 configuration option "unify_trace_failure" (global context only).
  4338 
  4339 * SELECT_GOAL now retains the syntactic context of the overall goal
  4340 state (schematic variables etc.).  Potential INCOMPATIBILITY in rare
  4341 situations.
  4342 
  4343 
  4344 *** HOL ***
  4345 
  4346 * Stronger precedence of syntax for big intersection and union on
  4347 sets, in accordance with corresponding lattice operations.
  4348 INCOMPATIBILITY.
  4349 
  4350 * Notation "{p:A. P}" now allows tuple patterns as well.
  4351 
  4352 * Nested case expressions are now translated in a separate check phase
  4353 rather than during parsing. The data for case combinators is separated
  4354 from the datatype package. The declaration attribute
  4355 "case_translation" can be used to register new case combinators:
  4356 
  4357   declare [[case_translation case_combinator constructor1 ... constructorN]]
  4358 
  4359 * Code generator:
  4360   - 'code_printing' unifies 'code_const' / 'code_type' / 'code_class' /
  4361     'code_instance'.
  4362   - 'code_identifier' declares name hints for arbitrary identifiers in
  4363     generated code, subsuming 'code_modulename'.
  4364 
  4365 See the isar-ref manual for syntax diagrams, and the HOL theories for
  4366 examples.
  4367 
  4368 * Attibute 'code': 'code' now declares concrete and abstract code
  4369 equations uniformly.  Use explicit 'code equation' and 'code abstract'
  4370 to distinguish both when desired.
  4371 
  4372 * Discontinued theories Code_Integer and Efficient_Nat by a more
  4373 fine-grain stack of theories Code_Target_Int, Code_Binary_Nat,
  4374 Code_Target_Nat and Code_Target_Numeral.  See the tutorial on code
  4375 generation for details.  INCOMPATIBILITY.
  4376 
  4377 * Numeric types are mapped by default to target language numerals:
  4378 natural (replaces former code_numeral) and integer (replaces former
  4379 code_int).  Conversions are available as integer_of_natural /
  4380 natural_of_integer / integer_of_nat / nat_of_integer (in HOL) and
  4381 Code_Numeral.integer_of_natural / Code_Numeral.natural_of_integer (in
  4382 ML).  INCOMPATIBILITY.
  4383 
  4384 * Function package: For mutually recursive functions f and g, separate
  4385 cases rules f.cases and g.cases are generated instead of unusable
  4386 f_g.cases which exposed internal sum types. Potential INCOMPATIBILITY,
  4387 in the case that the unusable rule was used nevertheless.
  4388 
  4389 * Function package: For each function f, new rules f.elims are
  4390 generated, which eliminate equalities of the form "f x = t".
  4391 
  4392 * New command 'fun_cases' derives ad-hoc elimination rules for
  4393 function equations as simplified instances of f.elims, analogous to
  4394 inductive_cases.  See ~~/src/HOL/ex/Fundefs.thy for some examples.
  4395 
  4396 * Lifting:
  4397   - parametrized correspondence relations are now supported:
  4398     + parametricity theorems for the raw term can be specified in
  4399       the command lift_definition, which allow us to generate stronger
  4400       transfer rules
  4401     + setup_lifting generates stronger transfer rules if parametric
  4402       correspondence relation can be generated
  4403     + various new properties of the relator must be specified to support
  4404       parametricity
  4405     + parametricity theorem for the Quotient relation can be specified
  4406   - setup_lifting generates domain rules for the Transfer package
  4407   - stronger reflexivity prover of respectfulness theorems for type
  4408     copies
  4409   - ===> and --> are now local. The symbols can be introduced
  4410     by interpreting the locale lifting_syntax (typically in an
  4411     anonymous context)
  4412   - Lifting/Transfer relevant parts of Library/Quotient_* are now in
  4413     Main. Potential INCOMPATIBILITY
  4414   - new commands for restoring and deleting Lifting/Transfer context:
  4415     lifting_forget, lifting_update
  4416   - the command print_quotmaps was renamed to print_quot_maps.
  4417     INCOMPATIBILITY
  4418 
  4419 * Transfer:
  4420   - better support for domains in Transfer: replace Domainp T
  4421     by the actual invariant in a transferred goal
  4422   - transfer rules can have as assumptions other transfer rules
  4423   - Experimental support for transferring from the raw level to the
  4424     abstract level: Transfer.transferred attribute
  4425   - Attribute version of the transfer method: untransferred attribute
  4426 
  4427 * Reification and reflection:
  4428   - Reification is now directly available in HOL-Main in structure
  4429     "Reification".
  4430   - Reflection now handles multiple lists with variables also.
  4431   - The whole reflection stack has been decomposed into conversions.
  4432 INCOMPATIBILITY.
  4433 
  4434 * Revised devices for recursive definitions over finite sets:
  4435   - Only one fundamental fold combinator on finite set remains:
  4436     Finite_Set.fold :: ('a => 'b => 'b) => 'b => 'a set => 'b
  4437     This is now identity on infinite sets.
  4438   - Locales ("mini packages") for fundamental definitions with
  4439     Finite_Set.fold: folding, folding_idem.
  4440   - Locales comm_monoid_set, semilattice_order_set and
  4441     semilattice_neutr_order_set for big operators on sets.
  4442     See theory Big_Operators for canonical examples.
  4443     Note that foundational constants comm_monoid_set.F and
  4444     semilattice_set.F correspond to former combinators fold_image
  4445     and fold1 respectively.  These are now gone.  You may use
  4446     those foundational constants as substitutes, but it is
  4447     preferable to interpret the above locales accordingly.
  4448   - Dropped class ab_semigroup_idem_mult (special case of lattice,
  4449     no longer needed in connection with Finite_Set.fold etc.)
  4450   - Fact renames:
  4451       card.union_inter ~> card_Un_Int [symmetric]
  4452       card.union_disjoint ~> card_Un_disjoint
  4453 INCOMPATIBILITY.
  4454 
  4455 * Locale hierarchy for abstract orderings and (semi)lattices.
  4456 
  4457 * Complete_Partial_Order.admissible is defined outside the type class
  4458 ccpo, but with mandatory prefix ccpo. Admissibility theorems lose the
  4459 class predicate assumption or sort constraint when possible.
  4460 INCOMPATIBILITY.
  4461 
  4462 * Introduce type class "conditionally_complete_lattice": Like a
  4463 complete lattice but does not assume the existence of the top and
  4464 bottom elements.  Allows to generalize some lemmas about reals and
  4465 extended reals.  Removed SupInf and replaced it by the instantiation
  4466 of conditionally_complete_lattice for real. Renamed lemmas about
  4467 conditionally-complete lattice from Sup_... to cSup_... and from
  4468 Inf_...  to cInf_... to avoid hidding of similar complete lattice
  4469 lemmas.
  4470 
  4471 * Introduce type class linear_continuum as combination of
  4472 conditionally-complete lattices and inner dense linorders which have
  4473 more than one element.  INCOMPATIBILITY.
  4474 
  4475 * Introduced type classes order_top and order_bot. The old classes top
  4476 and bot only contain the syntax without assumptions.  INCOMPATIBILITY:
  4477 Rename bot -> order_bot, top -> order_top
  4478 
  4479 * Introduce type classes "no_top" and "no_bot" for orderings without
  4480 top and bottom elements.
  4481 
  4482 * Split dense_linorder into inner_dense_order and no_top, no_bot.
  4483 
  4484 * Complex_Main: Unify and move various concepts from
  4485 HOL-Multivariate_Analysis to HOL-Complex_Main.
  4486 
  4487  - Introduce type class (lin)order_topology and
  4488    linear_continuum_topology.  Allows to generalize theorems about
  4489    limits and order.  Instances are reals and extended reals.
  4490 
  4491  - continuous and continuos_on from Multivariate_Analysis:
  4492    "continuous" is the continuity of a function at a filter.  "isCont"
  4493    is now an abbrevitation: "isCont x f == continuous (at _) f".
  4494 
  4495    Generalized continuity lemmas from isCont to continuous on an
  4496    arbitrary filter.
  4497 
  4498  - compact from Multivariate_Analysis. Use Bolzano's lemma to prove
  4499    compactness of closed intervals on reals. Continuous functions
  4500    attain infimum and supremum on compact sets. The inverse of a
  4501    continuous function is continuous, when the function is continuous
  4502    on a compact set.
  4503 
  4504  - connected from Multivariate_Analysis. Use it to prove the
  4505    intermediate value theorem. Show connectedness of intervals on
  4506    linear_continuum_topology).
  4507 
  4508  - first_countable_topology from Multivariate_Analysis. Is used to
  4509    show equivalence of properties on the neighbourhood filter of x and
  4510    on all sequences converging to x.
  4511 
  4512  - FDERIV: Definition of has_derivative moved to Deriv.thy. Moved
  4513    theorems from Library/FDERIV.thy to Deriv.thy and base the
  4514    definition of DERIV on FDERIV. Add variants of DERIV and FDERIV
  4515    which are restricted to sets, i.e. to represent derivatives from
  4516    left or right.
  4517 
  4518  - Removed the within-filter. It is replaced by the principal filter:
  4519 
  4520      F within X = inf F (principal X)
  4521 
  4522  - Introduce "at x within U" as a single constant, "at x" is now an
  4523    abbreviation for "at x within UNIV"
  4524 
  4525  - Introduce named theorem collections tendsto_intros,
  4526    continuous_intros, continuous_on_intros and FDERIV_intros. Theorems
  4527    in tendsto_intros (or FDERIV_intros) are also available as
  4528    tendsto_eq_intros (or FDERIV_eq_intros) where the right-hand side
  4529    is replaced by a congruence rule. This allows to apply them as
  4530    intro rules and then proving equivalence by the simplifier.
  4531 
  4532  - Restructured theories in HOL-Complex_Main:
  4533 
  4534    + Moved RealDef and RComplete into Real
  4535 
  4536    + Introduced Topological_Spaces and moved theorems about
  4537      topological spaces, filters, limits and continuity to it
  4538 
  4539    + Renamed RealVector to Real_Vector_Spaces
  4540 
  4541    + Split Lim, SEQ, Series into Topological_Spaces,
  4542      Real_Vector_Spaces, and Limits
  4543 
  4544    + Moved Ln and Log to Transcendental
  4545 
  4546    + Moved theorems about continuity from Deriv to Topological_Spaces
  4547 
  4548  - Remove various auxiliary lemmas.
  4549 
  4550 INCOMPATIBILITY.
  4551 
  4552 * Nitpick:
  4553   - Added option "spy".
  4554   - Reduce incidence of "too high arity" errors.
  4555 
  4556 * Sledgehammer:
  4557   - Renamed option:
  4558       isar_shrink ~> isar_compress
  4559     INCOMPATIBILITY.
  4560   - Added options "isar_try0", "spy".
  4561   - Better support for "isar_proofs".
  4562   - MaSh has been fined-tuned and now runs as a local server.
  4563 
  4564 * Improved support for ad hoc overloading of constants (see also
  4565 isar-ref manual and ~~/src/HOL/ex/Adhoc_Overloading_Examples.thy).
  4566 
  4567 * Library/Polynomial.thy:
  4568   - Use lifting for primitive definitions.
  4569   - Explicit conversions from and to lists of coefficients, used for
  4570     generated code.
  4571   - Replaced recursion operator poly_rec by fold_coeffs.
  4572   - Prefer pre-existing gcd operation for gcd.
  4573   - Fact renames:
  4574     poly_eq_iff ~> poly_eq_poly_eq_iff
  4575     poly_ext ~> poly_eqI
  4576     expand_poly_eq ~> poly_eq_iff
  4577 IMCOMPATIBILITY.
  4578 
  4579 * New Library/Simps_Case_Conv.thy: Provides commands simps_of_case and
  4580 case_of_simps to convert function definitions between a list of
  4581 equations with patterns on the lhs and a single equation with case
  4582 expressions on the rhs. See also Ex/Simps_Case_Conv_Examples.thy.
  4583 
  4584 * New Library/FSet.thy: type of finite sets defined as a subtype of
  4585 sets defined by Lifting/Transfer.
  4586 
  4587 * Discontinued theory src/HOL/Library/Eval_Witness.  INCOMPATIBILITY.
  4588 
  4589 * Consolidation of library theories on product orders:
  4590 
  4591     Product_Lattice ~> Product_Order -- pointwise order on products
  4592     Product_ord ~> Product_Lexorder -- lexicographic order on products
  4593 
  4594 INCOMPATIBILITY.
  4595 
  4596 * Imperative-HOL: The MREC combinator is considered legacy and no
  4597 longer included by default. INCOMPATIBILITY, use partial_function
  4598 instead, or import theory Legacy_Mrec as a fallback.
  4599 
  4600 * HOL-Algebra: Discontinued theories ~~/src/HOL/Algebra/abstract and
  4601 ~~/src/HOL/Algebra/poly.  Existing theories should be based on
  4602 ~~/src/HOL/Library/Polynomial instead.  The latter provides
  4603 integration with HOL's type classes for rings.  INCOMPATIBILITY.
  4604 
  4605 * HOL-BNF:
  4606   - Various improvements to BNF-based (co)datatype package, including
  4607     new commands "primrec_new", "primcorec", and
  4608     "datatype_new_compat", as well as documentation. See
  4609     "datatypes.pdf" for details.
  4610   - New "coinduction" method to avoid some boilerplate (compared to
  4611     coinduct).
  4612   - Renamed keywords:
  4613     data ~> datatype_new
  4614     codata ~> codatatype
  4615     bnf_def ~> bnf
  4616   - Renamed many generated theorems, including
  4617     discs ~> disc
  4618     map_comp' ~> map_comp
  4619     map_id' ~> map_id
  4620     sels ~> sel
  4621     set_map' ~> set_map
  4622     sets ~> set
  4623 IMCOMPATIBILITY.
  4624 
  4625 
  4626 *** ML ***
  4627 
  4628 * Spec_Check is a Quickcheck tool for Isabelle/ML.  The ML function
  4629 "check_property" allows to check specifications of the form "ALL x y
  4630 z. prop x y z".  See also ~~/src/Tools/Spec_Check/ with its
  4631 Examples.thy in particular.
  4632 
  4633 * Improved printing of exception trace in Poly/ML 5.5.1, with regular
  4634 tracing output in the command transaction context instead of physical
  4635 stdout.  See also Toplevel.debug, Toplevel.debugging and
  4636 ML_Compiler.exn_trace.
  4637 
  4638 * ML type "theory" is now immutable, without any special treatment of
  4639 drafts or linear updates (which could lead to "stale theory" errors in
  4640 the past).  Discontinued obsolete operations like Theory.copy,
  4641 Theory.checkpoint, and the auxiliary type theory_ref.  Minor
  4642 INCOMPATIBILITY.
  4643 
  4644 * More uniform naming of goal functions for skipped proofs:
  4645 
  4646     Skip_Proof.prove  ~>  Goal.prove_sorry
  4647     Skip_Proof.prove_global  ~>  Goal.prove_sorry_global
  4648 
  4649 Minor INCOMPATIBILITY.
  4650 
  4651 * Simplifier tactics and tools use proper Proof.context instead of
  4652 historic type simpset.  Old-style declarations like addsimps,
  4653 addsimprocs etc. operate directly on Proof.context.  Raw type simpset
  4654 retains its use as snapshot of the main Simplifier context, using
  4655 simpset_of and put_simpset on Proof.context.  INCOMPATIBILITY -- port
  4656 old tools by making them depend on (ctxt : Proof.context) instead of
  4657 (ss : simpset), then turn (simpset_of ctxt) into ctxt.
  4658 
  4659 * Modifiers for classical wrappers (e.g. addWrapper, delWrapper)
  4660 operate on Proof.context instead of claset, for uniformity with addIs,
  4661 addEs, addDs etc. Note that claset_of and put_claset allow to manage
  4662 clasets separately from the context.
  4663 
  4664 * Discontinued obsolete ML antiquotations @{claset} and @{simpset}.
  4665 INCOMPATIBILITY, use @{context} instead.
  4666 
  4667 * Antiquotation @{theory_context A} is similar to @{theory A}, but
  4668 presents the result as initial Proof.context.
  4669 
  4670 
  4671 *** System ***
  4672 
  4673 * Discontinued obsolete isabelle usedir, mkdir, make -- superseded by
  4674 "isabelle build" in Isabelle2013.  INCOMPATIBILITY.
  4675 
  4676 * Discontinued obsolete isabelle-process options -f and -u (former
  4677 administrative aliases of option -e).  Minor INCOMPATIBILITY.
  4678 
  4679 * Discontinued obsolete isabelle print tool, and PRINT_COMMAND
  4680 settings variable.
  4681 
  4682 * Discontinued ISABELLE_DOC_FORMAT settings variable and historic
  4683 document formats: dvi.gz, ps, ps.gz -- the default document format is
  4684 always pdf.
  4685 
  4686 * Isabelle settings variable ISABELLE_BUILD_JAVA_OPTIONS allows to
  4687 specify global resources of the JVM process run by isabelle build.
  4688 
  4689 * Toplevel executable $ISABELLE_HOME/bin/isabelle_scala_script allows
  4690 to run Isabelle/Scala source files as standalone programs.
  4691 
  4692 * Improved "isabelle keywords" tool (for old-style ProofGeneral
  4693 keyword tables): use Isabelle/Scala operations, which inspect outer
  4694 syntax without requiring to build sessions first.
  4695 
  4696 * Sessions may be organized via 'chapter' specifications in the ROOT
  4697 file, which determines a two-level hierarchy of browser info.  The old
  4698 tree-like organization via implicit sub-session relation (with its
  4699 tendency towards erratic fluctuation of URLs) has been discontinued.
  4700 The default chapter is called "Unsorted".  Potential INCOMPATIBILITY
  4701 for HTML presentation of theories.
  4702 
  4703 
  4704 
  4705 New in Isabelle2013 (February 2013)
  4706 -----------------------------------
  4707 
  4708 *** General ***
  4709 
  4710 * Theorem status about oracles and unfinished/failed future proofs is
  4711 no longer printed by default, since it is incompatible with
  4712 incremental / parallel checking of the persistent document model.  ML
  4713 function Thm.peek_status may be used to inspect a snapshot of the
  4714 ongoing evaluation process.  Note that in batch mode --- notably
  4715 isabelle build --- the system ensures that future proofs of all
  4716 accessible theorems in the theory context are finished (as before).
  4717 
  4718 * Configuration option show_markup controls direct inlining of markup
  4719 into the printed representation of formal entities --- notably type
  4720 and sort constraints.  This enables Prover IDE users to retrieve that
  4721 information via tooltips in the output window, for example.
  4722 
  4723 * Command 'ML_file' evaluates ML text from a file directly within the
  4724 theory, without any predeclaration via 'uses' in the theory header.
  4725 
  4726 * Old command 'use' command and corresponding keyword 'uses' in the
  4727 theory header are legacy features and will be discontinued soon.
  4728 Tools that load their additional source files may imitate the
  4729 'ML_file' implementation, such that the system can take care of
  4730 dependencies properly.
  4731 
  4732 * Discontinued obsolete method fastsimp / tactic fast_simp_tac, which
  4733 is called fastforce / fast_force_tac already since Isabelle2011-1.
  4734 
  4735 * Updated and extended "isar-ref" and "implementation" manual, reduced
  4736 remaining material in old "ref" manual.
  4737 
  4738 * Improved support for auxiliary contexts that indicate block structure
  4739 for specifications.  Nesting of "context fixes ... context assumes ..."
  4740 and "class ... context ...".
  4741 
  4742 * Attribute "consumes" allows a negative value as well, which is
  4743 interpreted relatively to the total number of premises of the rule in
  4744 the target context.  This form of declaration is stable when exported
  4745 from a nested 'context' with additional assumptions.  It is the
  4746 preferred form for definitional packages, notably cases/rules produced
  4747 in HOL/inductive and HOL/function.
  4748 
  4749 * More informative error messages for Isar proof commands involving
  4750 lazy enumerations (method applications etc.).
  4751 
  4752 * Refined 'help' command to retrieve outer syntax commands according
  4753 to name patterns (with clickable results).
  4754 
  4755 
  4756 *** Prover IDE -- Isabelle/Scala/jEdit ***
  4757 
  4758 * Parallel terminal proofs ('by') are enabled by default, likewise
  4759 proofs that are built into packages like 'datatype', 'function'.  This
  4760 allows to "run ahead" checking the theory specifications on the
  4761 surface, while the prover is still crunching on internal
  4762 justifications.  Unfinished / cancelled proofs are restarted as
  4763 required to complete full proof checking eventually.
  4764 
  4765 * Improved output panel with tooltips, hyperlinks etc. based on the
  4766 same Rich_Text_Area as regular Isabelle/jEdit buffers.  Activation of
  4767 tooltips leads to some window that supports the same recursively,
  4768 which can lead to stacks of tooltips as the semantic document content
  4769 is explored.  ESCAPE closes the whole stack, individual windows may be
  4770 closed separately, or detached to become independent jEdit dockables.
  4771 
  4772 * Improved support for commands that produce graph output: the text
  4773 message contains a clickable area to open a new instance of the graph
  4774 browser on demand.
  4775 
  4776 * More robust incremental parsing of outer syntax (partial comments,
  4777 malformed symbols).  Changing the balance of open/close quotes and
  4778 comment delimiters works more conveniently with unfinished situations
  4779 that frequently occur in user interaction.
  4780 
  4781 * More efficient painting and improved reactivity when editing large
  4782 files.  More scalable management of formal document content.
  4783 
  4784 * Smarter handling of tracing messages: prover process pauses after
  4785 certain number of messages per command transaction, with some user
  4786 dialog to stop or continue.  This avoids swamping the front-end with
  4787 potentially infinite message streams.
  4788 
  4789 * More plugin options and preferences, based on Isabelle/Scala.  The
  4790 jEdit plugin option panel provides access to some Isabelle/Scala
  4791 options, including tuning parameters for editor reactivity and color
  4792 schemes.
  4793 
  4794 * Dockable window "Symbols" provides some editing support for Isabelle
  4795 symbols.
  4796 
  4797 * Dockable window "Monitor" shows ML runtime statistics.  Note that
  4798 continuous display of the chart slows down the system.
  4799 
  4800 * Improved editing support for control styles: subscript, superscript,
  4801 bold, reset of style -- operating on single symbols or text
  4802 selections.  Cf. keyboard shortcuts C+e DOWN/UP/RIGHT/LEFT.
  4803 
  4804 * Actions isabelle.increase-font-size and isabelle.decrease-font-size
  4805 adjust the main text area font size, and its derivatives for output,
  4806 tooltips etc.  Cf. keyboard shortcuts C-PLUS and C-MINUS, which often
  4807 need to be adapted to local keyboard layouts.
  4808 
  4809 * More reactive completion popup by default: use \t (TAB) instead of
  4810 \n (NEWLINE) to minimize intrusion into regular flow of editing.  See
  4811 also "Plugin Options / SideKick / General / Code Completion Options".
  4812 
  4813 * Implicit check and build dialog of the specified logic session
  4814 image.  For example, HOL, HOLCF, HOL-Nominal can be produced on
  4815 demand, without bundling big platform-dependent heap images in the
  4816 Isabelle distribution.
  4817 
  4818 * Uniform Java 7 platform on Linux, Mac OS X, Windows: recent updates
  4819 from Oracle provide better multi-platform experience.  This version is
  4820 now bundled exclusively with Isabelle.
  4821 
  4822 
  4823 *** Pure ***
  4824 
  4825 * Code generation for Haskell: restrict unqualified imports from
  4826 Haskell Prelude to a small set of fundamental operations.
  4827 
  4828 * Command 'export_code': relative file names are interpreted
  4829 relatively to master directory of current theory rather than the
  4830 rather arbitrary current working directory.  INCOMPATIBILITY.
  4831 
  4832 * Discontinued obsolete attribute "COMP".  Potential INCOMPATIBILITY,
  4833 use regular rule composition via "OF" / "THEN", or explicit proof
  4834 structure instead.  Note that Isabelle/ML provides a variety of
  4835 operators like COMP, INCR_COMP, COMP_INCR, which need to be applied
  4836 with some care where this is really required.
  4837 
  4838 * Command 'typ' supports an additional variant with explicit sort
  4839 constraint, to infer and check the most general type conforming to a
  4840 given sort.  Example (in HOL):
  4841 
  4842   typ "_ * _ * bool * unit" :: finite
  4843 
  4844 * Command 'locale_deps' visualizes all locales and their relations as
  4845 a Hasse diagram.
  4846 
  4847 
  4848 *** HOL ***
  4849 
  4850 * Sledgehammer:
  4851 
  4852   - Added MaSh relevance filter based on machine-learning; see the
  4853     Sledgehammer manual for details.
  4854   - Polished Isar proofs generated with "isar_proofs" option.
  4855   - Rationalized type encodings ("type_enc" option).
  4856   - Renamed "kill_provers" subcommand to "kill_all".
  4857   - Renamed options:
  4858       isar_proof ~> isar_proofs
  4859       isar_shrink_factor ~> isar_shrink
  4860       max_relevant ~> max_facts
  4861       relevance_thresholds ~> fact_thresholds
  4862 
  4863 * Quickcheck: added an optimisation for equality premises.  It is
  4864 switched on by default, and can be switched off by setting the
  4865 configuration quickcheck_optimise_equality to false.
  4866 
  4867 * Quotient: only one quotient can be defined by quotient_type
  4868 INCOMPATIBILITY.
  4869 
  4870 * Lifting:
  4871   - generation of an abstraction function equation in lift_definition
  4872   - quot_del attribute
  4873   - renamed no_abs_code -> no_code (INCOMPATIBILITY.)
  4874 
  4875 * Simproc "finite_Collect" rewrites set comprehensions into pointfree
  4876 expressions.
  4877 
  4878 * Preprocessing of the code generator rewrites set comprehensions into
  4879 pointfree expressions.
  4880 
  4881 * The SMT solver Z3 has now by default a restricted set of directly
  4882 supported features. For the full set of features (div/mod, nonlinear
  4883 arithmetic, datatypes/records) with potential proof reconstruction
  4884 failures, enable the configuration option "z3_with_extensions".  Minor
  4885 INCOMPATIBILITY.
  4886 
  4887 * Simplified 'typedef' specifications: historical options for implicit
  4888 set definition and alternative name have been discontinued.  The
  4889 former behavior of "typedef (open) t = A" is now the default, but
  4890 written just "typedef t = A".  INCOMPATIBILITY, need to adapt theories
  4891 accordingly.
  4892 
  4893 * Removed constant "chars"; prefer "Enum.enum" on type "char"
  4894 directly.  INCOMPATIBILITY.
  4895 
  4896 * Moved operation product, sublists and n_lists from theory Enum to
  4897 List.  INCOMPATIBILITY.
  4898 
  4899 * Theorem UN_o generalized to SUP_comp.  INCOMPATIBILITY.
  4900 
  4901 * Class "comm_monoid_diff" formalises properties of bounded
  4902 subtraction, with natural numbers and multisets as typical instances.
  4903 
  4904 * Added combinator "Option.these" with type "'a option set => 'a set".
  4905 
  4906 * Theory "Transitive_Closure": renamed lemmas
  4907 
  4908   reflcl_tranclp -> reflclp_tranclp
  4909   rtranclp_reflcl -> rtranclp_reflclp
  4910 
  4911 INCOMPATIBILITY.
  4912 
  4913 * Theory "Rings": renamed lemmas (in class semiring)
  4914 
  4915   left_distrib ~> distrib_right
  4916   right_distrib ~> distrib_left
  4917 
  4918 INCOMPATIBILITY.
  4919 
  4920 * Generalized the definition of limits:
  4921 
  4922   - Introduced the predicate filterlim (LIM x F. f x :> G) which
  4923     expresses that when the input values x converge to F then the
  4924     output f x converges to G.
  4925 
  4926   - Added filters for convergence to positive (at_top) and negative
  4927     infinity (at_bot).
  4928 
  4929   - Moved infinity in the norm (at_infinity) from
  4930     Multivariate_Analysis to Complex_Main.
  4931 
  4932   - Removed real_tendsto_inf, it is superseded by "LIM x F. f x :>
  4933     at_top".
  4934 
  4935 INCOMPATIBILITY.
  4936 
  4937 * Theory "Library/Option_ord" provides instantiation of option type to
  4938 lattice type classes.
  4939 
  4940 * Theory "Library/Multiset": renamed
  4941 
  4942     constant fold_mset ~> Multiset.fold
  4943     fact fold_mset_commute ~> fold_mset_comm
  4944 
  4945 INCOMPATIBILITY.
  4946 
  4947 * Renamed theory Library/List_Prefix to Library/Sublist, with related
  4948 changes as follows.
  4949 
  4950   - Renamed constants (and related lemmas)
  4951 
  4952       prefix ~> prefixeq
  4953       strict_prefix ~> prefix
  4954 
  4955   - Replaced constant "postfix" by "suffixeq" with swapped argument
  4956     order (i.e., "postfix xs ys" is now "suffixeq ys xs") and dropped
  4957     old infix syntax "xs >>= ys"; use "suffixeq ys xs" instead.
  4958     Renamed lemmas accordingly.
  4959 
  4960   - Added constant "list_hembeq" for homeomorphic embedding on
  4961     lists. Added abbreviation "sublisteq" for special case
  4962     "list_hembeq (op =)".
  4963 
  4964   - Theory Library/Sublist no longer provides "order" and "bot" type
  4965     class instances for the prefix order (merely corresponding locale
  4966     interpretations). The type class instances are now in theory
  4967     Library/Prefix_Order.
  4968 
  4969   - The sublist relation of theory Library/Sublist_Order is now based
  4970     on "Sublist.sublisteq".  Renamed lemmas accordingly:
  4971 
  4972       le_list_append_le_same_iff ~> Sublist.sublisteq_append_le_same_iff
  4973       le_list_append_mono ~> Sublist.list_hembeq_append_mono
  4974       le_list_below_empty ~> Sublist.list_hembeq_Nil, Sublist.list_hembeq_Nil2
  4975       le_list_Cons_EX ~> Sublist.list_hembeq_ConsD
  4976       le_list_drop_Cons2 ~> Sublist.sublisteq_Cons2'
  4977       le_list_drop_Cons_neq ~> Sublist.sublisteq_Cons2_neq
  4978       le_list_drop_Cons ~> Sublist.sublisteq_Cons'
  4979       le_list_drop_many ~> Sublist.sublisteq_drop_many
  4980       le_list_filter_left ~> Sublist.sublisteq_filter_left
  4981       le_list_rev_drop_many ~> Sublist.sublisteq_rev_drop_many
  4982       le_list_rev_take_iff ~> Sublist.sublisteq_append
  4983       le_list_same_length ~> Sublist.sublisteq_same_length
  4984       le_list_take_many_iff ~> Sublist.sublisteq_append'
  4985       less_eq_list.drop ~> less_eq_list_drop
  4986       less_eq_list.induct ~> less_eq_list_induct
  4987       not_le_list_length ~> Sublist.not_sublisteq_length
  4988 
  4989 INCOMPATIBILITY.
  4990 
  4991 * New theory Library/Countable_Set.
  4992 
  4993 * Theory Library/Debug and Library/Parallel provide debugging and
  4994 parallel execution for code generated towards Isabelle/ML.
  4995 
  4996 * Theory Library/FuncSet: Extended support for Pi and extensional and
  4997 introduce the extensional dependent function space "PiE". Replaced
  4998 extensional_funcset by an abbreviation, and renamed lemmas from
  4999 extensional_funcset to PiE as follows:
  5000 
  5001   extensional_empty  ~>  PiE_empty
  5002   extensional_funcset_empty_domain  ~>  PiE_empty_domain
  5003   extensional_funcset_empty_range  ~>  PiE_empty_range
  5004   extensional_funcset_arb  ~>  PiE_arb
  5005   extensional_funcset_mem  ~>  PiE_mem
  5006   extensional_funcset_extend_domainI  ~>  PiE_fun_upd
  5007   extensional_funcset_restrict_domain  ~>  fun_upd_in_PiE
  5008   extensional_funcset_extend_domain_eq  ~>  PiE_insert_eq
  5009   card_extensional_funcset  ~>  card_PiE
  5010   finite_extensional_funcset  ~>  finite_PiE
  5011 
  5012 INCOMPATIBILITY.
  5013 
  5014 * Theory Library/FinFun: theory of almost everywhere constant
  5015 functions (supersedes the AFP entry "Code Generation for Functions as
  5016 Data").
  5017 
  5018 * Theory Library/Phantom: generic phantom type to make a type
  5019 parameter appear in a constant's type.  This alternative to adding
  5020 TYPE('a) as another parameter avoids unnecessary closures in generated
  5021 code.
  5022 
  5023 * Theory Library/RBT_Impl: efficient construction of red-black trees
  5024 from sorted associative lists. Merging two trees with rbt_union may
  5025 return a structurally different tree than before.  Potential
  5026 INCOMPATIBILITY.
  5027 
  5028 * Theory Library/IArray: immutable arrays with code generation.
  5029 
  5030 * Theory Library/Finite_Lattice: theory of finite lattices.
  5031 
  5032 * HOL/Multivariate_Analysis: replaced
  5033 
  5034   "basis :: 'a::euclidean_space => nat => real"
  5035   "\<Chi>\<Chi> :: (nat => real) => 'a::euclidean_space"
  5036 
  5037 on euclidean spaces by using the inner product "_ \<bullet> _" with
  5038 vectors from the Basis set: "\<Chi>\<Chi> i. f i" is superseded by
  5039 "SUM i : Basis. f i * r i".
  5040 
  5041   With this change the following constants are also changed or removed:
  5042 
  5043     DIM('a) :: nat  ~>  card (Basis :: 'a set)   (is an abbreviation)
  5044     a $$ i  ~>  inner a i  (where i : Basis)
  5045     cart_base i  removed
  5046     \<pi>, \<pi>'  removed
  5047 
  5048   Theorems about these constants where removed.
  5049 
  5050   Renamed lemmas:
  5051 
  5052     component_le_norm  ~>  Basis_le_norm
  5053     euclidean_eq  ~>  euclidean_eq_iff
  5054     differential_zero_maxmin_component  ~>  differential_zero_maxmin_cart
  5055     euclidean_simps  ~>  inner_simps
  5056     independent_basis  ~>  independent_Basis
  5057     span_basis  ~>  span_Basis
  5058     in_span_basis  ~>  in_span_Basis
  5059     norm_bound_component_le  ~>  norm_boound_Basis_le
  5060     norm_bound_component_lt  ~>  norm_boound_Basis_lt
  5061     component_le_infnorm  ~>  Basis_le_infnorm
  5062 
  5063 INCOMPATIBILITY.
  5064 
  5065 * HOL/Probability:
  5066 
  5067   - Added simproc "measurable" to automatically prove measurability.
  5068 
  5069   - Added induction rules for sigma sets with disjoint union
  5070     (sigma_sets_induct_disjoint) and for Borel-measurable functions
  5071     (borel_measurable_induct).
  5072 
  5073   - Added the Daniell-Kolmogorov theorem (the existence the limit of a
  5074     projective family).
  5075 
  5076 * HOL/Cardinals: Theories of ordinals and cardinals (supersedes the
  5077 AFP entry "Ordinals_and_Cardinals").
  5078 
  5079 * HOL/BNF: New (co)datatype package based on bounded natural functors
  5080 with support for mixed, nested recursion and interesting non-free
  5081 datatypes.
  5082 
  5083 * HOL/Finite_Set and Relation: added new set and relation operations
  5084 expressed by Finite_Set.fold.
  5085 
  5086 * New theory HOL/Library/RBT_Set: implementation of sets by red-black
  5087 trees for the code generator.
  5088 
  5089 * HOL/Library/RBT and HOL/Library/Mapping have been converted to
  5090 Lifting/Transfer.
  5091 possible INCOMPATIBILITY.
  5092 
  5093 * HOL/Set: renamed Set.project -> Set.filter
  5094 INCOMPATIBILITY.
  5095 
  5096 
  5097 *** Document preparation ***
  5098 
  5099 * Dropped legacy antiquotations "term_style" and "thm_style", since
  5100 styles may be given as arguments to "term" and "thm" already.
  5101 Discontinued legacy styles "prem1" .. "prem19".
  5102 
  5103 * Default LaTeX rendering for \<euro> is now based on eurosym package,
  5104 instead of slightly exotic babel/greek.
  5105 
  5106 * Document variant NAME may use different LaTeX entry point
  5107 document/root_NAME.tex if that file exists, instead of the common
  5108 document/root.tex.
  5109 
  5110 * Simplified custom document/build script, instead of old-style
  5111 document/IsaMakefile.  Minor INCOMPATIBILITY.
  5112 
  5113 
  5114 *** ML ***
  5115 
  5116 * The default limit for maximum number of worker threads is now 8,
  5117 instead of 4, in correspondence to capabilities of contemporary
  5118 hardware and Poly/ML runtime system.
  5119 
  5120 * Type Seq.results and related operations support embedded error
  5121 messages within lazy enumerations, and thus allow to provide
  5122 informative errors in the absence of any usable results.
  5123 
  5124 * Renamed Position.str_of to Position.here to emphasize that this is a
  5125 formal device to inline positions into message text, but not
  5126 necessarily printing visible text.
  5127 
  5128 
  5129 *** System ***
  5130 
  5131 * Advanced support for Isabelle sessions and build management, see
  5132 "system" manual for the chapter of that name, especially the "isabelle
  5133 build" tool and its examples.  The "isabelle mkroot" tool prepares
  5134 session root directories for use with "isabelle build", similar to
  5135 former "isabelle mkdir" for "isabelle usedir".  Note that this affects
  5136 document preparation as well.  INCOMPATIBILITY, isabelle usedir /
  5137 mkdir / make are rendered obsolete.
  5138 
  5139 * Discontinued obsolete Isabelle/build script, it is superseded by the
  5140 regular isabelle build tool.  For example:
  5141 
  5142   isabelle build -s -b HOL
  5143 
  5144 * Discontinued obsolete "isabelle makeall".
  5145 
  5146 * Discontinued obsolete IsaMakefile and ROOT.ML files from the
  5147 Isabelle distribution, except for rudimentary src/HOL/IsaMakefile that
  5148 provides some traditional targets that invoke "isabelle build".  Note
  5149 that this is inefficient!  Applications of Isabelle/HOL involving
  5150 "isabelle make" should be upgraded to use "isabelle build" directly.
  5151 
  5152 * The "isabelle options" tool prints Isabelle system options, as
  5153 required for "isabelle build", for example.
  5154 
  5155 * The "isabelle logo" tool produces EPS and PDF format simultaneously.
  5156 Minor INCOMPATIBILITY in command-line options.
  5157 
  5158 * The "isabelle install" tool has now a simpler command-line.  Minor
  5159 INCOMPATIBILITY.
  5160 
  5161 * The "isabelle components" tool helps to resolve add-on components
  5162 that are not bundled, or referenced from a bare-bones repository
  5163 version of Isabelle.
  5164 
  5165 * Settings variable ISABELLE_PLATFORM_FAMILY refers to the general
  5166 platform family: "linux", "macos", "windows".
  5167 
  5168 * The ML system is configured as regular component, and no longer
  5169 picked up from some surrounding directory.  Potential INCOMPATIBILITY
  5170 for home-made settings.
  5171 
  5172 * Improved ML runtime statistics (heap, threads, future tasks etc.).
  5173 
  5174 * Discontinued support for Poly/ML 5.2.1, which was the last version
  5175 without exception positions and advanced ML compiler/toplevel
  5176 configuration.
  5177 
  5178 * Discontinued special treatment of Proof General -- no longer guess
  5179 PROOFGENERAL_HOME based on accidental file-system layout.  Minor
  5180 INCOMPATIBILITY: provide PROOFGENERAL_HOME and PROOFGENERAL_OPTIONS
  5181 settings manually, or use a Proof General version that has been
  5182 bundled as Isabelle component.
  5183 
  5184 
  5185 
  5186 New in Isabelle2012 (May 2012)
  5187 ------------------------------
  5188 
  5189 *** General ***
  5190 
  5191 * Prover IDE (PIDE) improvements:
  5192 
  5193   - more robust Sledgehammer integration (as before the sledgehammer
  5194     command-line needs to be typed into the source buffer)
  5195   - markup for bound variables
  5196   - markup for types of term variables (displayed as tooltips)
  5197   - support for user-defined Isar commands within the running session
  5198   - improved support for Unicode outside original 16bit range
  5199     e.g. glyph for \<A> (thanks to jEdit 4.5.1)
  5200 
  5201 * Forward declaration of outer syntax keywords within the theory
  5202 header -- minor INCOMPATIBILITY for user-defined commands.  Allow new
  5203 commands to be used in the same theory where defined.
  5204 
  5205 * Auxiliary contexts indicate block structure for specifications with
  5206 additional parameters and assumptions.  Such unnamed contexts may be
  5207 nested within other targets, like 'theory', 'locale', 'class',
  5208 'instantiation' etc.  Results from the local context are generalized
  5209 accordingly and applied to the enclosing target context.  Example:
  5210 
  5211   context
  5212     fixes x y z :: 'a
  5213     assumes xy: "x = y" and yz: "y = z"
  5214   begin
  5215 
  5216   lemma my_trans: "x = z" using xy yz by simp
  5217 
  5218   end
  5219 
  5220   thm my_trans
  5221 
  5222 The most basic application is to factor-out context elements of
  5223 several fixes/assumes/shows theorem statements, e.g. see
  5224 ~~/src/HOL/Isar_Examples/Group_Context.thy
  5225 
  5226 Any other local theory specification element works within the "context
  5227 ... begin ... end" block as well.
  5228 
  5229 * Bundled declarations associate attributed fact expressions with a
  5230 given name in the context.  These may be later included in other
  5231 contexts.  This allows to manage context extensions casually, without
  5232 the logical dependencies of locales and locale interpretation.  See
  5233 commands 'bundle', 'include', 'including' etc. in the isar-ref manual.
  5234 
  5235 * Commands 'lemmas' and 'theorems' allow local variables using 'for'
  5236 declaration, and results are standardized before being stored.  Thus
  5237 old-style "standard" after instantiation or composition of facts
  5238 becomes obsolete.  Minor INCOMPATIBILITY, due to potential change of
  5239 indices of schematic variables.
  5240 
  5241 * Rule attributes in local theory declarations (e.g. locale or class)
  5242 are now statically evaluated: the resulting theorem is stored instead
  5243 of the original expression.  INCOMPATIBILITY in rare situations, where
  5244 the historic accident of dynamic re-evaluation in interpretations
  5245 etc. was exploited.
  5246 
  5247 * New tutorial "Programming and Proving in Isabelle/HOL"
  5248 ("prog-prove").  It completely supersedes "A Tutorial Introduction to
  5249 Structured Isar Proofs" ("isar-overview"), which has been removed.  It
  5250 also supersedes "Isabelle/HOL, A Proof Assistant for Higher-Order
  5251 Logic" as the recommended beginners tutorial, but does not cover all
  5252 of the material of that old tutorial.
  5253 
  5254 * Updated and extended reference manuals: "isar-ref",
  5255 "implementation", "system"; reduced remaining material in old "ref"
  5256 manual.
  5257 
  5258 
  5259 *** Pure ***
  5260 
  5261 * Command 'definition' no longer exports the foundational "raw_def"
  5262 into the user context.  Minor INCOMPATIBILITY, may use the regular
  5263 "def" result with attribute "abs_def" to imitate the old version.
  5264 
  5265 * Attribute "abs_def" turns an equation of the form "f x y == t" into
  5266 "f == %x y. t", which ensures that "simp" or "unfold" steps always
  5267 expand it.  This also works for object-logic equality.  (Formerly
  5268 undocumented feature.)
  5269 
  5270 * Sort constraints are now propagated in simultaneous statements, just
  5271 like type constraints.  INCOMPATIBILITY in rare situations, where
  5272 distinct sorts used to be assigned accidentally.  For example:
  5273 
  5274   lemma "P (x::'a::foo)" and "Q (y::'a::bar)"  -- "now illegal"
  5275 
  5276   lemma "P (x::'a)" and "Q (y::'a::bar)"
  5277     -- "now uniform 'a::bar instead of default sort for first occurrence (!)"
  5278 
  5279 * Rule composition via attribute "OF" (or ML functions OF/MRS) is more
  5280 tolerant against multiple unifiers, as long as the final result is
  5281 unique.  (As before, rules are composed in canonical right-to-left
  5282 order to accommodate newly introduced premises.)
  5283 
  5284 * Renamed some inner syntax categories:
  5285 
  5286     num ~> num_token
  5287     xnum ~> xnum_token
  5288     xstr ~> str_token
  5289 
  5290 Minor INCOMPATIBILITY.  Note that in practice "num_const" or
  5291 "num_position" etc. are mainly used instead (which also include
  5292 position information via constraints).
  5293 
  5294 * Simplified configuration options for syntax ambiguity: see
  5295 "syntax_ambiguity_warning" and "syntax_ambiguity_limit" in isar-ref
  5296 manual.  Minor INCOMPATIBILITY.
  5297 
  5298 * Discontinued configuration option "syntax_positions": atomic terms
  5299 in parse trees are always annotated by position constraints.
  5300 
  5301 * Old code generator for SML and its commands 'code_module',
  5302 'code_library', 'consts_code', 'types_code' have been discontinued.
  5303 Use commands of the generic code generator instead.  INCOMPATIBILITY.
  5304 
  5305 * Redundant attribute "code_inline" has been discontinued. Use
  5306 "code_unfold" instead.  INCOMPATIBILITY.
  5307 
  5308 * Dropped attribute "code_unfold_post" in favor of the its dual
  5309 "code_abbrev", which yields a common pattern in definitions like
  5310 
  5311   definition [code_abbrev]: "f = t"
  5312 
  5313 INCOMPATIBILITY.
  5314 
  5315 * Obsolete 'types' command has been discontinued.  Use 'type_synonym'
  5316 instead.  INCOMPATIBILITY.
  5317 
  5318 * Discontinued old "prems" fact, which used to refer to the accidental
  5319 collection of foundational premises in the context (already marked as
  5320 legacy since Isabelle2011).
  5321 
  5322 
  5323 *** HOL ***
  5324 
  5325 * Type 'a set is now a proper type constructor (just as before
  5326 Isabelle2008).  Definitions mem_def and Collect_def have disappeared.
  5327 Non-trivial INCOMPATIBILITY.  For developments keeping predicates and
  5328 sets separate, it is often sufficient to rephrase some set S that has
  5329 been accidentally used as predicates by "%x. x : S", and some
  5330 predicate P that has been accidentally used as set by "{x. P x}".
  5331 Corresponding proofs in a first step should be pruned from any
  5332 tinkering with former theorems mem_def and Collect_def as far as
  5333 possible.
  5334 
  5335 For developments which deliberately mix predicates and sets, a
  5336 planning step is necessary to determine what should become a predicate
  5337 and what a set.  It can be helpful to carry out that step in
  5338 Isabelle2011-1 before jumping right into the current release.
  5339 
  5340 * Code generation by default implements sets as container type rather
  5341 than predicates.  INCOMPATIBILITY.
  5342 
  5343 * New type synonym 'a rel = ('a * 'a) set
  5344 
  5345 * The representation of numerals has changed.  Datatype "num"
  5346 represents strictly positive binary numerals, along with functions
  5347 "numeral :: num => 'a" and "neg_numeral :: num => 'a" to represent
  5348 positive and negated numeric literals, respectively.  See also
  5349 definitions in ~~/src/HOL/Num.thy.  Potential INCOMPATIBILITY, some
  5350 user theories may require adaptations as follows:
  5351 
  5352   - Theorems with number_ring or number_semiring constraints: These
  5353     classes are gone; use comm_ring_1 or comm_semiring_1 instead.
  5354 
  5355   - Theories defining numeric types: Remove number, number_semiring,
  5356     and number_ring instances. Defer all theorems about numerals until
  5357     after classes one and semigroup_add have been instantiated.
  5358 
  5359   - Numeral-only simp rules: Replace each rule having a "number_of v"
  5360     pattern with two copies, one for numeral and one for neg_numeral.
  5361 
  5362   - Theorems about subclasses of semiring_1 or ring_1: These classes
  5363     automatically support numerals now, so more simp rules and
  5364     simprocs may now apply within the proof.
  5365 
  5366   - Definitions and theorems using old constructors Pls/Min/Bit0/Bit1:
  5367     Redefine using other integer operations.
  5368 
  5369 * Transfer: New package intended to generalize the existing
  5370 "descending" method and related theorem attributes from the Quotient
  5371 package.  (Not all functionality is implemented yet, but future
  5372 development will focus on Transfer as an eventual replacement for the
  5373 corresponding parts of the Quotient package.)
  5374 
  5375   - transfer_rule attribute: Maintains a collection of transfer rules,
  5376     which relate constants at two different types. Transfer rules may
  5377     relate different type instances of the same polymorphic constant,
  5378     or they may relate an operation on a raw type to a corresponding
  5379     operation on an abstract type (quotient or subtype). For example:
  5380 
  5381     ((A ===> B) ===> list_all2 A ===> list_all2 B) map map
  5382     (cr_int ===> cr_int ===> cr_int) (%(x,y) (u,v). (x+u, y+v)) plus_int
  5383 
  5384   - transfer method: Replaces a subgoal on abstract types with an
  5385     equivalent subgoal on the corresponding raw types. Constants are
  5386     replaced with corresponding ones according to the transfer rules.
  5387     Goals are generalized over all free variables by default; this is
  5388     necessary for variables whose types change, but can be overridden
  5389     for specific variables with e.g. "transfer fixing: x y z".  The
  5390     variant transfer' method allows replacing a subgoal with one that
  5391     is logically stronger (rather than equivalent).
  5392 
  5393   - relator_eq attribute: Collects identity laws for relators of
  5394     various type constructors, e.g. "list_all2 (op =) = (op =)".  The
  5395     transfer method uses these lemmas to infer transfer rules for
  5396     non-polymorphic constants on the fly.
  5397 
  5398   - transfer_prover method: Assists with proving a transfer rule for a
  5399     new constant, provided the constant is defined in terms of other
  5400     constants that already have transfer rules. It should be applied
  5401     after unfolding the constant definitions.
  5402 
  5403   - HOL/ex/Transfer_Int_Nat.thy: Example theory demonstrating transfer
  5404     from type nat to type int.
  5405 
  5406 * Lifting: New package intended to generalize the quotient_definition
  5407 facility of the Quotient package; designed to work with Transfer.
  5408 
  5409   - lift_definition command: Defines operations on an abstract type in
  5410     terms of a corresponding operation on a representation
  5411     type.  Example syntax:
  5412 
  5413     lift_definition dlist_insert :: "'a => 'a dlist => 'a dlist"
  5414       is List.insert
  5415 
  5416     Users must discharge a respectfulness proof obligation when each
  5417     constant is defined. (For a type copy, i.e. a typedef with UNIV,
  5418     the proof is discharged automatically.) The obligation is
  5419     presented in a user-friendly, readable form; a respectfulness
  5420     theorem in the standard format and a transfer rule are generated
  5421     by the package.
  5422 
  5423   - Integration with code_abstype: For typedefs (e.g. subtypes
  5424     corresponding to a datatype invariant, such as dlist),
  5425     lift_definition generates a code certificate theorem and sets up
  5426     code generation for each constant.
  5427 
  5428   - setup_lifting command: Sets up the Lifting package to work with a
  5429     user-defined type. The user must provide either a quotient theorem
  5430     or a type_definition theorem.  The package configures transfer
  5431     rules for equality and quantifiers on the type, and sets up the
  5432     lift_definition command to work with the type.
  5433 
  5434   - Usage examples: See Quotient_Examples/Lift_DList.thy,
  5435     Quotient_Examples/Lift_RBT.thy, Quotient_Examples/Lift_FSet.thy,
  5436     Word/Word.thy and Library/Float.thy.
  5437 
  5438 * Quotient package:
  5439 
  5440   - The 'quotient_type' command now supports a 'morphisms' option with
  5441     rep and abs functions, similar to typedef.
  5442 
  5443   - 'quotient_type' sets up new types to work with the Lifting and
  5444     Transfer packages, as with 'setup_lifting'.
  5445 
  5446   - The 'quotient_definition' command now requires the user to prove a
  5447     respectfulness property at the point where the constant is
  5448     defined, similar to lift_definition; INCOMPATIBILITY.
  5449 
  5450   - Renamed predicate 'Quotient' to 'Quotient3', and renamed theorems
  5451     accordingly, INCOMPATIBILITY.
  5452 
  5453 * New diagnostic command 'find_unused_assms' to find potentially
  5454 superfluous assumptions in theorems using Quickcheck.
  5455 
  5456 * Quickcheck:
  5457 
  5458   - Quickcheck returns variable assignments as counterexamples, which
  5459     allows to reveal the underspecification of functions under test.
  5460     For example, refuting "hd xs = x", it presents the variable
  5461     assignment xs = [] and x = a1 as a counterexample, assuming that
  5462     any property is false whenever "hd []" occurs in it.
  5463 
  5464     These counterexample are marked as potentially spurious, as
  5465     Quickcheck also returns "xs = []" as a counterexample to the
  5466     obvious theorem "hd xs = hd xs".
  5467 
  5468     After finding a potentially spurious counterexample, Quickcheck
  5469     continues searching for genuine ones.
  5470 
  5471     By default, Quickcheck shows potentially spurious and genuine
  5472     counterexamples. The option "genuine_only" sets quickcheck to only
  5473     show genuine counterexamples.
  5474 
  5475   - The command 'quickcheck_generator' creates random and exhaustive
  5476     value generators for a given type and operations.
  5477 
  5478     It generates values by using the operations as if they were
  5479     constructors of that type.
  5480 
  5481   - Support for multisets.
  5482 
  5483   - Added "use_subtype" options.
  5484 
  5485   - Added "quickcheck_locale" configuration to specify how to process
  5486     conjectures in a locale context.
  5487 
  5488 * Nitpick: Fixed infinite loop caused by the 'peephole_optim' option
  5489 and affecting 'rat' and 'real'.
  5490 
  5491 * Sledgehammer:
  5492   - Integrated more tightly with SPASS, as described in the ITP 2012
  5493     paper "More SPASS with Isabelle".
  5494   - Made it try "smt" as a fallback if "metis" fails or times out.
  5495   - Added support for the following provers: Alt-Ergo (via Why3 and
  5496     TFF1), iProver, iProver-Eq.
  5497   - Sped up the minimizer.
  5498   - Added "lam_trans", "uncurry_aliases", and "minimize" options.
  5499   - Renamed "slicing" ("no_slicing") option to "slice" ("dont_slice").
  5500   - Renamed "sound" option to "strict".
  5501 
  5502 * Metis: Added possibility to specify lambda translations scheme as a
  5503 parenthesized argument (e.g., "by (metis (lifting) ...)").
  5504 
  5505 * SMT: Renamed "smt_fixed" option to "smt_read_only_certificates".
  5506 
  5507 * Command 'try0': Renamed from 'try_methods'. INCOMPATIBILITY.
  5508 
  5509 * New "case_product" attribute to generate a case rule doing multiple
  5510 case distinctions at the same time.  E.g.
  5511 
  5512   list.exhaust [case_product nat.exhaust]
  5513 
  5514 produces a rule which can be used to perform case distinction on both
  5515 a list and a nat.
  5516 
  5517 * New "eventually_elim" method as a generalized variant of the
  5518 eventually_elim* rules.  Supports structured proofs.
  5519 
  5520 * Typedef with implicit set definition is considered legacy.  Use
  5521 "typedef (open)" form instead, which will eventually become the
  5522 default.
  5523 
  5524 * Record: code generation can be switched off manually with
  5525 
  5526   declare [[record_coden = false]]  -- "default true"
  5527 
  5528 * Datatype: type parameters allow explicit sort constraints.
  5529 
  5530 * Concrete syntax for case expressions includes constraints for source
  5531 positions, and thus produces Prover IDE markup for its bindings.
  5532 INCOMPATIBILITY for old-style syntax translations that augment the
  5533 pattern notation; e.g. see src/HOL/HOLCF/One.thy for translations of
  5534 one_case.
  5535 
  5536 * Clarified attribute "mono_set": pure declaration without modifying
  5537 the result of the fact expression.
  5538 
  5539 * More default pred/set conversions on a couple of relation operations
  5540 and predicates.  Added powers of predicate relations.  Consolidation
  5541 of some relation theorems:
  5542 
  5543   converse_def ~> converse_unfold
  5544   rel_comp_def ~> relcomp_unfold
  5545   symp_def ~> (modified, use symp_def and sym_def instead)
  5546   transp_def ~> transp_trans
  5547   Domain_def ~> Domain_unfold
  5548   Range_def ~> Domain_converse [symmetric]
  5549 
  5550 Generalized theorems INF_INT_eq, INF_INT_eq2, SUP_UN_eq, SUP_UN_eq2.
  5551 
  5552 See theory "Relation" for examples for making use of pred/set
  5553 conversions by means of attributes "to_set" and "to_pred".
  5554 
  5555 INCOMPATIBILITY.
  5556 
  5557 * Renamed facts about the power operation on relations, i.e., relpow
  5558 to match the constant's name:
  5559 
  5560   rel_pow_1 ~> relpow_1
  5561   rel_pow_0_I ~> relpow_0_I
  5562   rel_pow_Suc_I ~> relpow_Suc_I
  5563   rel_pow_Suc_I2 ~> relpow_Suc_I2
  5564   rel_pow_0_E ~> relpow_0_E
  5565   rel_pow_Suc_E ~> relpow_Suc_E
  5566   rel_pow_E ~> relpow_E
  5567   rel_pow_Suc_D2 ~> relpow_Suc_D2
  5568   rel_pow_Suc_E2 ~> relpow_Suc_E2
  5569   rel_pow_Suc_D2' ~> relpow_Suc_D2'
  5570   rel_pow_E2 ~> relpow_E2
  5571   rel_pow_add ~> relpow_add
  5572   rel_pow_commute ~> relpow
  5573   rel_pow_empty ~> relpow_empty:
  5574   rtrancl_imp_UN_rel_pow ~> rtrancl_imp_UN_relpow
  5575   rel_pow_imp_rtrancl ~> relpow_imp_rtrancl
  5576   rtrancl_is_UN_rel_pow ~> rtrancl_is_UN_relpow
  5577   rtrancl_imp_rel_pow ~> rtrancl_imp_relpow
  5578   rel_pow_fun_conv ~> relpow_fun_conv
  5579   rel_pow_finite_bounded1 ~> relpow_finite_bounded1
  5580   rel_pow_finite_bounded ~> relpow_finite_bounded
  5581   rtrancl_finite_eq_rel_pow ~> rtrancl_finite_eq_relpow
  5582   trancl_finite_eq_rel_pow ~> trancl_finite_eq_relpow
  5583   single_valued_rel_pow ~> single_valued_relpow
  5584 
  5585 INCOMPATIBILITY.
  5586 
  5587 * Theory Relation: Consolidated constant name for relation composition
  5588 and corresponding theorem names:
  5589 
  5590   - Renamed constant rel_comp to relcomp.
  5591 
  5592   - Dropped abbreviation pred_comp. Use relcompp instead.
  5593 
  5594   - Renamed theorems:
  5595 
  5596     rel_compI ~> relcompI
  5597     rel_compEpair ~> relcompEpair
  5598     rel_compE ~> relcompE
  5599     pred_comp_rel_comp_eq ~> relcompp_relcomp_eq
  5600     rel_comp_empty1 ~> relcomp_empty1
  5601     rel_comp_mono ~> relcomp_mono
  5602     rel_comp_subset_Sigma ~> relcomp_subset_Sigma
  5603     rel_comp_distrib ~> relcomp_distrib
  5604     rel_comp_distrib2 ~> relcomp_distrib2
  5605     rel_comp_UNION_distrib ~> relcomp_UNION_distrib
  5606     rel_comp_UNION_distrib2 ~> relcomp_UNION_distrib2
  5607     single_valued_rel_comp ~> single_valued_relcomp
  5608     rel_comp_def ~> relcomp_unfold
  5609     converse_rel_comp ~> converse_relcomp
  5610     pred_compI ~> relcomppI
  5611     pred_compE ~> relcomppE
  5612     pred_comp_bot1 ~> relcompp_bot1
  5613     pred_comp_bot2 ~> relcompp_bot2
  5614     transp_pred_comp_less_eq ~> transp_relcompp_less_eq
  5615     pred_comp_mono ~> relcompp_mono
  5616     pred_comp_distrib ~> relcompp_distrib
  5617     pred_comp_distrib2 ~> relcompp_distrib2
  5618     converse_pred_comp ~> converse_relcompp
  5619 
  5620     finite_rel_comp ~> finite_relcomp
  5621 
  5622     set_rel_comp ~> set_relcomp
  5623 
  5624 INCOMPATIBILITY.
  5625 
  5626 * Theory Divides: Discontinued redundant theorems about div and mod.
  5627 INCOMPATIBILITY, use the corresponding generic theorems instead.
  5628 
  5629   DIVISION_BY_ZERO ~> div_by_0, mod_by_0
  5630   zdiv_self ~> div_self
  5631   zmod_self ~> mod_self
  5632   zdiv_zero ~> div_0
  5633   zmod_zero ~> mod_0
  5634   zdiv_zmod_equality ~> div_mod_equality2
  5635   zdiv_zmod_equality2 ~> div_mod_equality
  5636   zmod_zdiv_trivial ~> mod_div_trivial
  5637   zdiv_zminus_zminus ~> div_minus_minus
  5638   zmod_zminus_zminus ~> mod_minus_minus
  5639   zdiv_zminus2 ~> div_minus_right
  5640   zmod_zminus2 ~> mod_minus_right
  5641   zdiv_minus1_right ~> div_minus1_right
  5642   zmod_minus1_right ~> mod_minus1_right
  5643   zdvd_mult_div_cancel ~> dvd_mult_div_cancel
  5644   zmod_zmult1_eq ~> mod_mult_right_eq
  5645   zpower_zmod ~> power_mod
  5646   zdvd_zmod ~> dvd_mod
  5647   zdvd_zmod_imp_zdvd ~> dvd_mod_imp_dvd
  5648   mod_mult_distrib ~> mult_mod_left
  5649   mod_mult_distrib2 ~> mult_mod_right
  5650 
  5651 * Removed redundant theorems nat_mult_2 and nat_mult_2_right; use
  5652 generic mult_2 and mult_2_right instead. INCOMPATIBILITY.
  5653 
  5654 * Finite_Set.fold now qualified.  INCOMPATIBILITY.
  5655 
  5656 * Consolidated theorem names concerning fold combinators:
  5657 
  5658   inf_INFI_fold_inf ~> inf_INF_fold_inf
  5659   sup_SUPR_fold_sup ~> sup_SUP_fold_sup
  5660   INFI_fold_inf ~> INF_fold_inf
  5661   SUPR_fold_sup ~> SUP_fold_sup
  5662   union_set ~> union_set_fold
  5663   minus_set ~> minus_set_fold
  5664   INFI_set_fold ~> INF_set_fold
  5665   SUPR_set_fold ~> SUP_set_fold
  5666   INF_code ~> INF_set_foldr
  5667   SUP_code ~> SUP_set_foldr
  5668   foldr.simps ~> foldr.simps (in point-free formulation)
  5669   foldr_fold_rev ~> foldr_conv_fold
  5670   foldl_fold ~> foldl_conv_fold
  5671   foldr_foldr ~> foldr_conv_foldl
  5672   foldl_foldr ~> foldl_conv_foldr
  5673   fold_set_remdups ~> fold_set_fold_remdups
  5674   fold_set ~> fold_set_fold
  5675   fold1_set ~> fold1_set_fold
  5676 
  5677 INCOMPATIBILITY.
  5678 
  5679 * Dropped rarely useful theorems concerning fold combinators:
  5680 foldl_apply, foldl_fun_comm, foldl_rev, fold_weak_invariant,
  5681 rev_foldl_cons, fold_set_remdups, fold_set, fold_set1,
  5682 concat_conv_foldl, foldl_weak_invariant, foldl_invariant,
  5683 foldr_invariant, foldl_absorb0, foldl_foldr1_lemma, foldl_foldr1,
  5684 listsum_conv_fold, listsum_foldl, sort_foldl_insort, foldl_assoc,
  5685 foldr_conv_foldl, start_le_sum, elem_le_sum, sum_eq_0_conv.
  5686 INCOMPATIBILITY.  For the common phrases "%xs. List.foldr plus xs 0"
  5687 and "List.foldl plus 0", prefer "List.listsum".  Otherwise it can be
  5688 useful to boil down "List.foldr" and "List.foldl" to "List.fold" by
  5689 unfolding "foldr_conv_fold" and "foldl_conv_fold".
  5690 
  5691 * Dropped lemmas minus_set_foldr, union_set_foldr, union_coset_foldr,
  5692 inter_coset_foldr, Inf_fin_set_foldr, Sup_fin_set_foldr,
  5693 Min_fin_set_foldr, Max_fin_set_foldr, Inf_set_foldr, Sup_set_foldr,
  5694 INF_set_foldr, SUP_set_foldr.  INCOMPATIBILITY.  Prefer corresponding
  5695 lemmas over fold rather than foldr, or make use of lemmas
  5696 fold_conv_foldr and fold_rev.
  5697 
  5698 * Congruence rules Option.map_cong and Option.bind_cong for recursion
  5699 through option types.
  5700 
  5701 * "Transitive_Closure.ntrancl": bounded transitive closure on
  5702 relations.
  5703 
  5704 * Constant "Set.not_member" now qualified.  INCOMPATIBILITY.
  5705 
  5706 * Theory Int: Discontinued many legacy theorems specific to type int.
  5707 INCOMPATIBILITY, use the corresponding generic theorems instead.
  5708 
  5709   zminus_zminus ~> minus_minus
  5710   zminus_0 ~> minus_zero
  5711   zminus_zadd_distrib ~> minus_add_distrib
  5712   zadd_commute ~> add_commute
  5713   zadd_assoc ~> add_assoc
  5714   zadd_left_commute ~> add_left_commute
  5715   zadd_ac ~> add_ac
  5716   zmult_ac ~> mult_ac
  5717   zadd_0 ~> add_0_left
  5718   zadd_0_right ~> add_0_right
  5719   zadd_zminus_inverse2 ~> left_minus
  5720   zmult_zminus ~> mult_minus_left
  5721   zmult_commute ~> mult_commute
  5722   zmult_assoc ~> mult_assoc
  5723   zadd_zmult_distrib ~> left_distrib
  5724   zadd_zmult_distrib2 ~> right_distrib
  5725   zdiff_zmult_distrib ~> left_diff_distrib
  5726   zdiff_zmult_distrib2 ~> right_diff_distrib
  5727   zmult_1 ~> mult_1_left
  5728   zmult_1_right ~> mult_1_right
  5729   zle_refl ~> order_refl
  5730   zle_trans ~> order_trans
  5731   zle_antisym ~> order_antisym
  5732   zle_linear ~> linorder_linear
  5733   zless_linear ~> linorder_less_linear
  5734   zadd_left_mono ~> add_left_mono
  5735   zadd_strict_right_mono ~> add_strict_right_mono
  5736   zadd_zless_mono ~> add_less_le_mono
  5737   int_0_less_1 ~> zero_less_one
  5738   int_0_neq_1 ~> zero_neq_one
  5739   zless_le ~> less_le
  5740   zpower_zadd_distrib ~> power_add
  5741   zero_less_zpower_abs_iff ~> zero_less_power_abs_iff
  5742   zero_le_zpower_abs ~> zero_le_power_abs
  5743 
  5744 * Theory Deriv: Renamed
  5745 
  5746   DERIV_nonneg_imp_nonincreasing ~> DERIV_nonneg_imp_nondecreasing
  5747 
  5748 * Theory Library/Multiset: Improved code generation of multisets.
  5749 
  5750 * Theory HOL/Library/Set_Algebras: Addition and multiplication on sets
  5751 are expressed via type classes again. The special syntax
  5752 \<oplus>/\<otimes> has been replaced by plain +/*. Removed constant
  5753 setsum_set, which is now subsumed by Big_Operators.setsum.
  5754 INCOMPATIBILITY.
  5755 
  5756 * Theory HOL/Library/Diagonalize has been removed. INCOMPATIBILITY,
  5757 use theory HOL/Library/Nat_Bijection instead.
  5758 
  5759 * Theory HOL/Library/RBT_Impl: Backing implementation of red-black
  5760 trees is now inside a type class context.  Names of affected
  5761 operations and lemmas have been prefixed by rbt_.  INCOMPATIBILITY for
  5762 theories working directly with raw red-black trees, adapt the names as
  5763 follows:
  5764 
  5765   Operations:
  5766   bulkload -> rbt_bulkload
  5767   del_from_left -> rbt_del_from_left
  5768   del_from_right -> rbt_del_from_right
  5769   del -> rbt_del
  5770   delete -> rbt_delete
  5771   ins -> rbt_ins
  5772   insert -> rbt_insert
  5773   insertw -> rbt_insert_with
  5774   insert_with_key -> rbt_insert_with_key
  5775   map_entry -> rbt_map_entry
  5776   lookup -> rbt_lookup
  5777   sorted -> rbt_sorted
  5778   tree_greater -> rbt_greater
  5779   tree_less -> rbt_less
  5780   tree_less_symbol -> rbt_less_symbol
  5781   union -> rbt_union
  5782   union_with -> rbt_union_with
  5783   union_with_key -> rbt_union_with_key
  5784 
  5785   Lemmas:
  5786   balance_left_sorted -> balance_left_rbt_sorted
  5787   balance_left_tree_greater -> balance_left_rbt_greater
  5788   balance_left_tree_less -> balance_left_rbt_less
  5789   balance_right_sorted -> balance_right_rbt_sorted
  5790   balance_right_tree_greater -> balance_right_rbt_greater
  5791   balance_right_tree_less -> balance_right_rbt_less
  5792   balance_sorted -> balance_rbt_sorted
  5793   balance_tree_greater -> balance_rbt_greater
  5794   balance_tree_less -> balance_rbt_less
  5795   bulkload_is_rbt -> rbt_bulkload_is_rbt
  5796   combine_sorted -> combine_rbt_sorted
  5797   combine_tree_greater -> combine_rbt_greater
  5798   combine_tree_less -> combine_rbt_less
  5799   delete_in_tree -> rbt_delete_in_tree
  5800   delete_is_rbt -> rbt_delete_is_rbt
  5801   del_from_left_tree_greater -> rbt_del_from_left_rbt_greater
  5802   del_from_left_tree_less -> rbt_del_from_left_rbt_less
  5803   del_from_right_tree_greater -> rbt_del_from_right_rbt_greater
  5804   del_from_right_tree_less -> rbt_del_from_right_rbt_less
  5805   del_in_tree -> rbt_del_in_tree
  5806   del_inv1_inv2 -> rbt_del_inv1_inv2
  5807   del_sorted -> rbt_del_rbt_sorted
  5808   del_tree_greater -> rbt_del_rbt_greater
  5809   del_tree_less -> rbt_del_rbt_less
  5810   dom_lookup_Branch -> dom_rbt_lookup_Branch
  5811   entries_lookup -> entries_rbt_lookup
  5812   finite_dom_lookup -> finite_dom_rbt_lookup
  5813   insert_sorted -> rbt_insert_rbt_sorted
  5814   insertw_is_rbt -> rbt_insertw_is_rbt
  5815   insertwk_is_rbt -> rbt_insertwk_is_rbt
  5816   insertwk_sorted -> rbt_insertwk_rbt_sorted
  5817   insertw_sorted -> rbt_insertw_rbt_sorted
  5818   ins_sorted -> ins_rbt_sorted
  5819   ins_tree_greater -> ins_rbt_greater
  5820   ins_tree_less -> ins_rbt_less
  5821   is_rbt_sorted -> is_rbt_rbt_sorted
  5822   lookup_balance -> rbt_lookup_balance
  5823   lookup_bulkload -> rbt_lookup_rbt_bulkload
  5824   lookup_delete -> rbt_lookup_rbt_delete
  5825   lookup_Empty -> rbt_lookup_Empty
  5826   lookup_from_in_tree -> rbt_lookup_from_in_tree
  5827   lookup_in_tree -> rbt_lookup_in_tree
  5828   lookup_ins -> rbt_lookup_ins
  5829   lookup_insert -> rbt_lookup_rbt_insert
  5830   lookup_insertw -> rbt_lookup_rbt_insertw
  5831   lookup_insertwk -> rbt_lookup_rbt_insertwk
  5832   lookup_keys -> rbt_lookup_keys
  5833   lookup_map -> rbt_lookup_map
  5834   lookup_map_entry -> rbt_lookup_rbt_map_entry
  5835   lookup_tree_greater -> rbt_lookup_rbt_greater
  5836   lookup_tree_less -> rbt_lookup_rbt_less
  5837   lookup_union -> rbt_lookup_rbt_union
  5838   map_entry_color_of -> rbt_map_entry_color_of
  5839   map_entry_inv1 -> rbt_map_entry_inv1
  5840   map_entry_inv2 -> rbt_map_entry_inv2
  5841   map_entry_is_rbt -> rbt_map_entry_is_rbt
  5842   map_entry_sorted -> rbt_map_entry_rbt_sorted
  5843   map_entry_tree_greater -> rbt_map_entry_rbt_greater
  5844   map_entry_tree_less -> rbt_map_entry_rbt_less
  5845   map_tree_greater -> map_rbt_greater
  5846   map_tree_less -> map_rbt_less
  5847   map_sorted -> map_rbt_sorted
  5848   paint_sorted -> paint_rbt_sorted
  5849   paint_lookup -> paint_rbt_lookup
  5850   paint_tree_greater -> paint_rbt_greater
  5851   paint_tree_less -> paint_rbt_less
  5852   sorted_entries -> rbt_sorted_entries
  5853   tree_greater_eq_trans -> rbt_greater_eq_trans
  5854   tree_greater_nit -> rbt_greater_nit
  5855   tree_greater_prop -> rbt_greater_prop
  5856   tree_greater_simps -> rbt_greater_simps
  5857   tree_greater_trans -> rbt_greater_trans
  5858   tree_less_eq_trans -> rbt_less_eq_trans
  5859   tree_less_nit -> rbt_less_nit
  5860   tree_less_prop -> rbt_less_prop
  5861   tree_less_simps -> rbt_less_simps
  5862   tree_less_trans -> rbt_less_trans
  5863   tree_ord_props -> rbt_ord_props
  5864   union_Branch -> rbt_union_Branch
  5865   union_is_rbt -> rbt_union_is_rbt
  5866   unionw_is_rbt -> rbt_unionw_is_rbt
  5867   unionwk_is_rbt -> rbt_unionwk_is_rbt
  5868   unionwk_sorted -> rbt_unionwk_rbt_sorted
  5869 
  5870 * Theory HOL/Library/Float: Floating point numbers are now defined as
  5871 a subset of the real numbers.  All operations are defined using the
  5872 lifing-framework and proofs use the transfer method.  INCOMPATIBILITY.
  5873 
  5874   Changed Operations:
  5875   float_abs -> abs
  5876   float_nprt -> nprt
  5877   float_pprt -> pprt
  5878   pow2 -> use powr
  5879   round_down -> float_round_down
  5880   round_up -> float_round_up
  5881   scale -> exponent
  5882 
  5883   Removed Operations:
  5884   ceiling_fl, lb_mult, lb_mod, ub_mult, ub_mod
  5885 
  5886   Renamed Lemmas:
  5887   abs_float_def -> Float.compute_float_abs
  5888   bitlen_ge0 -> bitlen_nonneg
  5889   bitlen.simps -> Float.compute_bitlen
  5890   float_components -> Float_mantissa_exponent
  5891   float_divl.simps -> Float.compute_float_divl
  5892   float_divr.simps -> Float.compute_float_divr
  5893   float_eq_odd -> mult_powr_eq_mult_powr_iff
  5894   float_power -> real_of_float_power
  5895   lapprox_posrat_def -> Float.compute_lapprox_posrat
  5896   lapprox_rat.simps -> Float.compute_lapprox_rat
  5897   le_float_def' -> Float.compute_float_le
  5898   le_float_def -> less_eq_float.rep_eq
  5899   less_float_def' -> Float.compute_float_less
  5900   less_float_def -> less_float.rep_eq
  5901   normfloat_def -> Float.compute_normfloat
  5902   normfloat_imp_odd_or_zero -> mantissa_not_dvd and mantissa_noteq_0
  5903   normfloat -> normfloat_def
  5904   normfloat_unique -> use normfloat_def
  5905   number_of_float_Float -> Float.compute_float_numeral, Float.compute_float_neg_numeral
  5906   one_float_def -> Float.compute_float_one
  5907   plus_float_def -> Float.compute_float_plus
  5908   rapprox_posrat_def -> Float.compute_rapprox_posrat
  5909   rapprox_rat.simps -> Float.compute_rapprox_rat
  5910   real_of_float_0 -> zero_float.rep_eq
  5911   real_of_float_1 -> one_float.rep_eq
  5912   real_of_float_abs -> abs_float.rep_eq
  5913   real_of_float_add -> plus_float.rep_eq
  5914   real_of_float_minus -> uminus_float.rep_eq
  5915   real_of_float_mult -> times_float.rep_eq
  5916   real_of_float_simp -> Float.rep_eq
  5917   real_of_float_sub -> minus_float.rep_eq
  5918   round_down.simps -> Float.compute_float_round_down
  5919   round_up.simps -> Float.compute_float_round_up
  5920   times_float_def -> Float.compute_float_times
  5921   uminus_float_def -> Float.compute_float_uminus
  5922   zero_float_def -> Float.compute_float_zero
  5923 
  5924   Lemmas not necessary anymore, use the transfer method:
  5925   bitlen_B0, bitlen_B1, bitlen_ge1, bitlen_Min, bitlen_Pls, float_divl,
  5926   float_divr, float_le_simp, float_less1_mantissa_bound,
  5927   float_less_simp, float_less_zero, float_le_zero,
  5928   float_pos_less1_e_neg, float_pos_m_pos, float_split, float_split2,
  5929   floor_pos_exp, lapprox_posrat, lapprox_posrat_bottom, lapprox_rat,
  5930   lapprox_rat_bottom, normalized_float, rapprox_posrat,
  5931   rapprox_posrat_le1, rapprox_rat, real_of_float_ge0_exp,
  5932   real_of_float_neg_exp, real_of_float_nge0_exp, round_down floor_fl,
  5933   round_up, zero_le_float, zero_less_float
  5934 
  5935 * New theory HOL/Library/DAList provides an abstract type for
  5936 association lists with distinct keys.
  5937 
  5938 * Session HOL/IMP: Added new theory of abstract interpretation of
  5939 annotated commands.
  5940 
  5941 * Session HOL-Import: Re-implementation from scratch is faster,
  5942 simpler, and more scalable.  Requires a proof bundle, which is
  5943 available as an external component.  Discontinued old (and mostly
  5944 dead) Importer for HOL4 and HOL Light.  INCOMPATIBILITY.
  5945 
  5946 * Session HOL-Word: Discontinued many redundant theorems specific to
  5947 type 'a word. INCOMPATIBILITY, use the corresponding generic theorems
  5948 instead.
  5949 
  5950   word_sub_alt ~> word_sub_wi
  5951   word_add_alt ~> word_add_def
  5952   word_mult_alt ~> word_mult_def
  5953   word_minus_alt ~> word_minus_def
  5954   word_0_alt ~> word_0_wi
  5955   word_1_alt ~> word_1_wi
  5956   word_add_0 ~> add_0_left
  5957   word_add_0_right ~> add_0_right
  5958   word_mult_1 ~> mult_1_left
  5959   word_mult_1_right ~> mult_1_right
  5960   word_add_commute ~> add_commute
  5961   word_add_assoc ~> add_assoc
  5962   word_add_left_commute ~> add_left_commute
  5963   word_mult_commute ~> mult_commute
  5964   word_mult_assoc ~> mult_assoc
  5965   word_mult_left_commute ~> mult_left_commute
  5966   word_left_distrib ~> left_distrib
  5967   word_right_distrib ~> right_distrib
  5968   word_left_minus ~> left_minus
  5969   word_diff_0_right ~> diff_0_right
  5970   word_diff_self ~> diff_self
  5971   word_sub_def ~> diff_minus
  5972   word_diff_minus ~> diff_minus
  5973   word_add_ac ~> add_ac
  5974   word_mult_ac ~> mult_ac
  5975   word_plus_ac0 ~> add_0_left add_0_right add_ac
  5976   word_times_ac1 ~> mult_1_left mult_1_right mult_ac
  5977   word_order_trans ~> order_trans
  5978   word_order_refl ~> order_refl
  5979   word_order_antisym ~> order_antisym
  5980   word_order_linear ~> linorder_linear
  5981   lenw1_zero_neq_one ~> zero_neq_one
  5982   word_number_of_eq ~> number_of_eq
  5983   word_of_int_add_hom ~> wi_hom_add
  5984   word_of_int_sub_hom ~> wi_hom_sub
  5985   word_of_int_mult_hom ~> wi_hom_mult
  5986   word_of_int_minus_hom ~> wi_hom_neg
  5987   word_of_int_succ_hom ~> wi_hom_succ
  5988   word_of_int_pred_hom ~> wi_hom_pred
  5989   word_of_int_0_hom ~> word_0_wi
  5990   word_of_int_1_hom ~> word_1_wi
  5991 
  5992 * Session HOL-Word: New proof method "word_bitwise" for splitting
  5993 machine word equalities and inequalities into logical circuits,
  5994 defined in HOL/Word/WordBitwise.thy.  Supports addition, subtraction,
  5995 multiplication, shifting by constants, bitwise operators and numeric
  5996 constants.  Requires fixed-length word types, not 'a word.  Solves
  5997 many standard word identities outright and converts more into first
  5998 order problems amenable to blast or similar.  See also examples in
  5999 HOL/Word/Examples/WordExamples.thy.
  6000 
  6001 * Session HOL-Probability: Introduced the type "'a measure" to
  6002 represent measures, this replaces the records 'a algebra and 'a
  6003 measure_space.  The locales based on subset_class now have two
  6004 locale-parameters the space \<Omega> and the set of measurable sets M.
  6005 The product of probability spaces uses now the same constant as the
  6006 finite product of sigma-finite measure spaces "PiM :: ('i => 'a)
  6007 measure".  Most constants are defined now outside of locales and gain
  6008 an additional parameter, like null_sets, almost_eventually or \<mu>'.
  6009 Measure space constructions for distributions and densities now got
  6010 their own constants distr and density.  Instead of using locales to
  6011 describe measure spaces with a finite space, the measure count_space
  6012 and point_measure is introduced.  INCOMPATIBILITY.
  6013 
  6014   Renamed constants:
  6015   measure -> emeasure
  6016   finite_measure.\<mu>' -> measure
  6017   product_algebra_generator -> prod_algebra
  6018   product_prob_space.emb -> prod_emb
  6019   product_prob_space.infprod_algebra -> PiM
  6020 
  6021   Removed locales:
  6022   completeable_measure_space
  6023   finite_measure_space
  6024   finite_prob_space
  6025   finite_product_finite_prob_space
  6026   finite_product_sigma_algebra
  6027   finite_sigma_algebra
  6028   measure_space
  6029   pair_finite_prob_space
  6030   pair_finite_sigma_algebra
  6031   pair_finite_space
  6032   pair_sigma_algebra
  6033   product_sigma_algebra
  6034 
  6035   Removed constants:
  6036   conditional_space
  6037   distribution -> use distr measure, or distributed predicate
  6038   image_space
  6039   joint_distribution -> use distr measure, or distributed predicate
  6040   pair_measure_generator
  6041   product_prob_space.infprod_algebra -> use PiM
  6042   subvimage
  6043 
  6044   Replacement theorems:
  6045   finite_additivity_sufficient -> ring_of_sets.countably_additiveI_finite
  6046   finite_measure.empty_measure -> measure_empty
  6047   finite_measure.finite_continuity_from_above -> finite_measure.finite_Lim_measure_decseq
  6048   finite_measure.finite_continuity_from_below -> finite_measure.finite_Lim_measure_incseq
  6049   finite_measure.finite_measure_countably_subadditive -> finite_measure.finite_measure_subadditive_countably
  6050   finite_measure.finite_measure_eq -> finite_measure.emeasure_eq_measure
  6051   finite_measure.finite_measure -> finite_measure.emeasure_finite
  6052   finite_measure.finite_measure_finite_singleton -> finite_measure.finite_measure_eq_setsum_singleton
  6053   finite_measure.positive_measure' -> measure_nonneg
  6054   finite_measure.real_measure -> finite_measure.emeasure_real
  6055   finite_product_prob_space.finite_measure_times -> finite_product_prob_space.finite_measure_PiM_emb
  6056   finite_product_sigma_algebra.in_P -> sets_PiM_I_finite
  6057   finite_product_sigma_algebra.P_empty -> space_PiM_empty, sets_PiM_empty
  6058   information_space.conditional_entropy_eq -> information_space.conditional_entropy_simple_distributed
  6059   information_space.conditional_entropy_positive -> information_space.conditional_entropy_nonneg_simple
  6060   information_space.conditional_mutual_information_eq_mutual_information -> information_space.conditional_mutual_information_eq_mutual_information_simple
  6061   information_space.conditional_mutual_information_generic_positive -> information_space.conditional_mutual_information_nonneg_simple
  6062   information_space.conditional_mutual_information_positive -> information_space.conditional_mutual_information_nonneg_simple
  6063   information_space.entropy_commute -> information_space.entropy_commute_simple
  6064   information_space.entropy_eq -> information_space.entropy_simple_distributed
  6065   information_space.entropy_generic_eq -> information_space.entropy_simple_distributed
  6066   information_space.entropy_positive -> information_space.entropy_nonneg_simple
  6067   information_space.entropy_uniform_max -> information_space.entropy_uniform
  6068   information_space.KL_eq_0_imp -> information_space.KL_eq_0_iff_eq
  6069   information_space.KL_eq_0 -> information_space.KL_same_eq_0
  6070   information_space.KL_ge_0 -> information_space.KL_nonneg
  6071   information_space.mutual_information_eq -> information_space.mutual_information_simple_distributed
  6072   information_space.mutual_information_positive -> information_space.mutual_information_nonneg_simple
  6073   Int_stable_cuboids -> Int_stable_atLeastAtMost
  6074   Int_stable_product_algebra_generator -> positive_integral
  6075   measure_preserving -> equality "distr M N f = N" "f : measurable M N"
  6076   measure_space.additive -> emeasure_additive
  6077   measure_space.AE_iff_null_set -> AE_iff_null
  6078   measure_space.almost_everywhere_def -> eventually_ae_filter
  6079   measure_space.almost_everywhere_vimage -> AE_distrD
  6080   measure_space.continuity_from_above -> INF_emeasure_decseq
  6081   measure_space.continuity_from_above_Lim -> Lim_emeasure_decseq
  6082   measure_space.continuity_from_below_Lim -> Lim_emeasure_incseq
  6083   measure_space.continuity_from_below -> SUP_emeasure_incseq
  6084   measure_space_density -> emeasure_density
  6085   measure_space.density_is_absolutely_continuous -> absolutely_continuousI_density
  6086   measure_space.integrable_vimage -> integrable_distr
  6087   measure_space.integral_translated_density -> integral_density
  6088   measure_space.integral_vimage -> integral_distr
  6089   measure_space.measure_additive -> plus_emeasure
  6090   measure_space.measure_compl -> emeasure_compl
  6091   measure_space.measure_countable_increasing -> emeasure_countable_increasing
  6092   measure_space.measure_countably_subadditive -> emeasure_subadditive_countably
  6093   measure_space.measure_decseq -> decseq_emeasure
  6094   measure_space.measure_Diff -> emeasure_Diff
  6095   measure_space.measure_Diff_null_set -> emeasure_Diff_null_set
  6096   measure_space.measure_eq_0 -> emeasure_eq_0
  6097   measure_space.measure_finitely_subadditive -> emeasure_subadditive_finite
  6098   measure_space.measure_finite_singleton -> emeasure_eq_setsum_singleton
  6099   measure_space.measure_incseq -> incseq_emeasure
  6100   measure_space.measure_insert -> emeasure_insert
  6101   measure_space.measure_mono -> emeasure_mono
  6102   measure_space.measure_not_negative -> emeasure_not_MInf
  6103   measure_space.measure_preserving_Int_stable -> measure_eqI_generator_eq
  6104   measure_space.measure_setsum -> setsum_emeasure
  6105   measure_space.measure_setsum_split -> setsum_emeasure_cover
  6106   measure_space.measure_space_vimage -> emeasure_distr
  6107   measure_space.measure_subadditive_finite -> emeasure_subadditive_finite
  6108   measure_space.measure_subadditive -> subadditive
  6109   measure_space.measure_top -> emeasure_space
  6110   measure_space.measure_UN_eq_0 -> emeasure_UN_eq_0
  6111   measure_space.measure_Un_null_set -> emeasure_Un_null_set
  6112   measure_space.positive_integral_translated_density -> positive_integral_density
  6113   measure_space.positive_integral_vimage -> positive_integral_distr
  6114   measure_space.real_continuity_from_above -> Lim_measure_decseq
  6115   measure_space.real_continuity_from_below -> Lim_measure_incseq
  6116   measure_space.real_measure_countably_subadditive -> measure_subadditive_countably
  6117   measure_space.real_measure_Diff -> measure_Diff
  6118   measure_space.real_measure_finite_Union -> measure_finite_Union
  6119   measure_space.real_measure_setsum_singleton -> measure_eq_setsum_singleton
  6120   measure_space.real_measure_subadditive -> measure_subadditive
  6121   measure_space.real_measure_Union -> measure_Union
  6122   measure_space.real_measure_UNION -> measure_UNION
  6123   measure_space.simple_function_vimage -> simple_function_comp
  6124   measure_space.simple_integral_vimage -> simple_integral_distr
  6125   measure_space.simple_integral_vimage -> simple_integral_distr
  6126   measure_unique_Int_stable -> measure_eqI_generator_eq
  6127   measure_unique_Int_stable_vimage -> measure_eqI_generator_eq
  6128   pair_sigma_algebra.measurable_cut_fst -> sets_Pair1
  6129   pair_sigma_algebra.measurable_cut_snd -> sets_Pair2
  6130   pair_sigma_algebra.measurable_pair_image_fst -> measurable_Pair1
  6131   pair_sigma_algebra.measurable_pair_image_snd -> measurable_Pair2
  6132   pair_sigma_algebra.measurable_product_swap -> measurable_pair_swap_iff
  6133   pair_sigma_algebra.pair_sigma_algebra_measurable -> measurable_pair_swap
  6134   pair_sigma_algebra.pair_sigma_algebra_swap_measurable -> measurable_pair_swap'
  6135   pair_sigma_algebra.sets_swap -> sets_pair_swap
  6136   pair_sigma_finite.measure_cut_measurable_fst -> pair_sigma_finite.measurable_emeasure_Pair1
  6137   pair_sigma_finite.measure_cut_measurable_snd -> pair_sigma_finite.measurable_emeasure_Pair2
  6138   pair_sigma_finite.measure_preserving_swap -> pair_sigma_finite.distr_pair_swap
  6139   pair_sigma_finite.pair_measure_alt2 -> pair_sigma_finite.emeasure_pair_measure_alt2
  6140   pair_sigma_finite.pair_measure_alt -> pair_sigma_finite.emeasure_pair_measure_alt
  6141   pair_sigma_finite.pair_measure_times -> pair_sigma_finite.emeasure_pair_measure_Times
  6142   prob_space.indep_distribution_eq_measure -> prob_space.indep_vars_iff_distr_eq_PiM
  6143   prob_space.indep_var_distributionD -> prob_space.indep_var_distribution_eq
  6144   prob_space.measure_space_1 -> prob_space.emeasure_space_1
  6145   prob_space.prob_space_vimage -> prob_space_distr
  6146   prob_space.random_variable_restrict -> measurable_restrict
  6147   prob_space_unique_Int_stable -> measure_eqI_prob_space
  6148   product_algebraE -> prod_algebraE_all
  6149   product_algebra_generator_der -> prod_algebra_eq_finite
  6150   product_algebra_generator_into_space -> prod_algebra_sets_into_space
  6151   product_algebraI -> sets_PiM_I_finite
  6152   product_measure_exists -> product_sigma_finite.sigma_finite
  6153   product_prob_space.finite_index_eq_finite_product -> product_prob_space.sets_PiM_generator
  6154   product_prob_space.finite_measure_infprod_emb_Pi -> product_prob_space.measure_PiM_emb
  6155   product_prob_space.infprod_spec -> product_prob_space.emeasure_PiM_emb_not_empty
  6156   product_prob_space.measurable_component -> measurable_component_singleton
  6157   product_prob_space.measurable_emb -> measurable_prod_emb
  6158   product_prob_space.measurable_into_infprod_algebra -> measurable_PiM_single
  6159   product_prob_space.measurable_singleton_infprod -> measurable_component_singleton
  6160   product_prob_space.measure_emb -> emeasure_prod_emb
  6161   product_prob_space.measure_preserving_restrict -> product_prob_space.distr_restrict
  6162   product_sigma_algebra.product_algebra_into_space -> space_closed
  6163   product_sigma_finite.measure_fold -> product_sigma_finite.distr_merge
  6164   product_sigma_finite.measure_preserving_component_singelton -> product_sigma_finite.distr_singleton
  6165   product_sigma_finite.measure_preserving_merge -> product_sigma_finite.distr_merge
  6166   sequence_space.measure_infprod -> sequence_space.measure_PiM_countable
  6167   sets_product_algebra -> sets_PiM
  6168   sigma_algebra.measurable_sigma -> measurable_measure_of
  6169   sigma_finite_measure.disjoint_sigma_finite -> sigma_finite_disjoint
  6170   sigma_finite_measure.RN_deriv_vimage -> sigma_finite_measure.RN_deriv_distr
  6171   sigma_product_algebra_sigma_eq -> sigma_prod_algebra_sigma_eq
  6172   space_product_algebra -> space_PiM
  6173 
  6174 * Session HOL-TPTP: support to parse and import TPTP problems (all
  6175 languages) into Isabelle/HOL.
  6176 
  6177 
  6178 *** FOL ***
  6179 
  6180 * New "case_product" attribute (see HOL).
  6181 
  6182 
  6183 *** ZF ***
  6184 
  6185 * Greater support for structured proofs involving induction or case
  6186 analysis.
  6187 
  6188 * Much greater use of mathematical symbols.
  6189 
  6190 * Removal of many ML theorem bindings.  INCOMPATIBILITY.
  6191 
  6192 
  6193 *** ML ***
  6194 
  6195 * Antiquotation @{keyword "name"} produces a parser for outer syntax
  6196 from a minor keyword introduced via theory header declaration.
  6197 
  6198 * Antiquotation @{command_spec "name"} produces the
  6199 Outer_Syntax.command_spec from a major keyword introduced via theory
  6200 header declaration; it can be passed to Outer_Syntax.command etc.
  6201 
  6202 * Local_Theory.define no longer hard-wires default theorem name
  6203 "foo_def", but retains the binding as given.  If that is Binding.empty
  6204 / Attrib.empty_binding, the result is not registered as user-level
  6205 fact.  The Local_Theory.define_internal variant allows to specify a
  6206 non-empty name (used for the foundation in the background theory),
  6207 while omitting the fact binding in the user-context.  Potential
  6208 INCOMPATIBILITY for derived definitional packages: need to specify
  6209 naming policy for primitive definitions more explicitly.
  6210 
  6211 * Renamed Thm.capply to Thm.apply, and Thm.cabs to Thm.lambda in
  6212 conformance with similar operations in structure Term and Logic.
  6213 
  6214 * Antiquotation @{attributes [...]} embeds attribute source
  6215 representation into the ML text, which is particularly useful with
  6216 declarations like Local_Theory.note.
  6217 
  6218 * Structure Proof_Context follows standard naming scheme.  Old
  6219 ProofContext has been discontinued.  INCOMPATIBILITY.
  6220 
  6221 * Refined Local_Theory.declaration {syntax, pervasive}, with subtle
  6222 change of semantics: update is applied to auxiliary local theory
  6223 context as well.
  6224 
  6225 * Modernized some old-style infix operations:
  6226 
  6227   addeqcongs    ~> Simplifier.add_eqcong
  6228   deleqcongs    ~> Simplifier.del_eqcong
  6229   addcongs      ~> Simplifier.add_cong
  6230   delcongs      ~> Simplifier.del_cong
  6231   setmksimps    ~> Simplifier.set_mksimps
  6232   setmkcong     ~> Simplifier.set_mkcong
  6233   setmksym      ~> Simplifier.set_mksym
  6234   setmkeqTrue   ~> Simplifier.set_mkeqTrue
  6235   settermless   ~> Simplifier.set_termless
  6236   setsubgoaler  ~> Simplifier.set_subgoaler
  6237   addsplits     ~> Splitter.add_split
  6238   delsplits     ~> Splitter.del_split
  6239 
  6240 
  6241 *** System ***
  6242 
  6243 * USER_HOME settings variable points to cross-platform user home
  6244 directory, which coincides with HOME on POSIX systems only.  Likewise,
  6245 the Isabelle path specification "~" now expands to $USER_HOME, instead
  6246 of former $HOME.  A different default for USER_HOME may be set
  6247 explicitly in shell environment, before Isabelle settings are
  6248 evaluated.  Minor INCOMPATIBILITY: need to adapt Isabelle path where
  6249 the generic user home was intended.
  6250 
  6251 * ISABELLE_HOME_WINDOWS refers to ISABELLE_HOME in windows file name
  6252 notation, which is useful for the jEdit file browser, for example.
  6253 
  6254 * ISABELLE_JDK_HOME settings variable points to JDK with javac and jar
  6255 (not just JRE