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