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