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