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