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