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