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