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