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