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