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