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