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