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