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