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