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