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