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