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