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