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