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