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