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