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