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