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