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