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