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