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