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