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