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