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