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