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