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