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