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