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