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