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