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