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