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