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