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