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