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