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