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