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