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