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