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