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