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