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