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