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