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