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