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