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