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