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