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