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