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