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