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