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