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