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