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