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