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