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