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