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