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