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